1. A version of the popular problem-solving task involves presenting people with an array of 42
pictures, seven rows of six pictures each, and asking them to indentify the target picture by
asking questions that can be answered yes or no. Further, people are then required to identify the
picture with as few questions as possible. Suggest the most efficient algorithm for this problem
and indicate the largest number of questions that may be necessary.
Solution
Well each question could feasibly half the number of pictures. Q1 makes 21. Q2
makes 10/11. Q3 makes 5/6. Q4 makes 2/3. Q5 makes 1/2. Q6 makes 1. So 6 questions may be
necessary. you can also do 2^n>42 where n is an element of z (integers) and that would be 6.