
problem
Treasure hunt
Can you find a reliable strategy for choosing coordinates that will locate the treasure in the minimum number of guesses?
Can you find a reliable strategy for choosing coordinates that will locate the treasure in the minimum number of guesses?
On the graph there are 28 marked points. These points all mark the vertices (corners) of eight hidden squares. Can you find the eight hidden squares?
A tilted square is a square with no horizontal sides. Can you devise a general instruction for the construction of a square when you are given just one of its sides?