Determine minimal number of moves to find cells on a square table 10×10 in which a treasure is hidden

Question

In a 10x10 square table, two neigbouring 1x1 cells contain a hidden treasure. John needs to guess these cells. In one move he can choose some cell of the table and can get information whether there is treasure in it or not. Determine the minimum number of moves, and explain the strategy, that always allows John to find the cells in which the treasure is hidden.

Bubbler · Answer

I think I can do it in

How to achieve it:

Now, why is this optimal?

Nautilus · Answer

Determine minimal number of moves to find cells on a square table 10×10 in which a treasure is hidden

2 Answers

Add your own answers!

Ask a Question