In: Computer Science
"Einstein riddle" The riddle asked us to complete a table of answers in a way that ensured various constraints were satisfied. A "correct" answer to the riddle was a completed table that satisfied all the constraints provided. The table was 5 rows by 5 columns. For each row you could pick the order of 5 parameters - for example, the order of 5 different colours or 5 different car models. In this particular problem there were no duplicate assignments - i.e. you couldn't have two cars of the same colour or make.
Would enforcing less constraints have made our program find a solution faster or slower. Why ? . How large was the search space for this problem before we applied constraints ? (i.e. how many different ways were there to complete the table) . Explain why understanding the size of the search space is one of the first things you should do when investigating a new problem . How would allowing duplication on the colour of the cars affected the problem ?
EXPLANATION:
Ques) Would enforcing less constraints have made our program find a solution faster or slower. Why ?
Answer) Enforcing less constraints in the program would help the program find a solution faster. This is because the program searches for the possible solutions in the search space. It needs to check all the constraints for each sample in the search space for a solution. Having less of these contraints would mean checking for less constraints for each sample and would take less time for each sample which means for many samples it would add up considerably. Also, having less constraints means it is more likely that the sample which we are checking would turn out to be a solution. Hence, we are more likely to find solutions quickly as the samples would need to satisfy less constraints.
It is recommended to ask different questions seperately as I am only allowed to answer 1 question at a time.
THANKS,
PLEASE UPOTE THE ANSWER.