I found this one to be easy (hope I didn't mess up) - is there anybody at the Olympiad who did NOT solve it?Another fun problem:Turbo the snail plays a game on a board with 2024 rows and 2023 columns. ...
It also seems the solution is independent of the number of rows, columns, and monsters, so long as number of rows=N, number of columns=N-1, and number of monsters=N-2 with all the other conditions being the same.
I showed the solution with 11 rows, 10 columns, 9 monsters. Same principle for any other N, N-1, N-2 row/ column/ monster set-up.
Statistics: Posted by sudarshan — 19 Jul 2024 07:34