Simulator of Proj 1:
Two versions of simulator going to be used picked by each group
Proj 2:
Theoretical minimum of guess?
Case dependent?
Try to reduce possibilities
Guess everything at beginning. Good information retrival, but hard coded strategy may be abused by the mapper
Divide and conquer? Will that actually restrict the information we get from across queries?
Mapping of length 3 as example. Query of all numbers have 3 possible categories of returnings. They can reduce all possibilities from 27 to either 6 or 6 or 1.
Deliverable next Wednesday. At least a guesser to play with the dumb mapper shipped with the simulator.
(n/2, n] guarranteed algorithm given by Siyang
Related to problem of dropping 2 eggs from high?
No comments:
Post a Comment