Chessboard Problems.
Jake and Logan play a game on a chessboard. In the beginning the board is empty. In every turn, Logan places a black knight on an empty square in such a way that his new knight does not attack any previous knights. Then Jake places a white queen on an empty square. The game gets finished when somebody cannot move.
Find the maximal positive such that, regardless of the strategy of Jake, Logan can put at least knights on the board.
The answer is 1020100.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!