Find The Diamond!

Logic Level 3

There is a diamond hidden on an N×NN\times N grid at location (xD,yD)(x_D,y_D), where xDx_D and yDy_D are integers.

Every guess, you suggest a pair of coordinates (xGx_G, yGy_G). And, if you get it wrong you are given a hint as to where to go to continue looking. You are told either NW, N, NE, E, SE, S, SW, or W:

  • W implies xD<xGx_D < x_G and yD=yGy_D = y_G
  • NW implies xD<xGx_D < x_G and yD>yGy_D > y_G
  • etc.

If you can get the diamond with 10 guesses or less (i.e. at most 9 wrong guesses and one right one), you get to keep the diamond. What is the largest NN for which you can guarantee success?


Problem Loading...

Note Loading...

Set Loading...