Stepping Stones Puzzle
This task is adapted from following video with Neil Sloane (founder of the On-Line Encyclopedia of Integer Sequences), that you should watch first to learn, how this excellent puzzle works.
You have got a certain number of 🟤 stones (1 point each) anywhere on the board. Now you add ⚪ stones with increasing points value (2, 3, 4 ...) on the board. The rule of placement is: you can only put down a ⚪ stone with value k if sum of values of its eight neighbors (🟤 and/or ⚪) is k.
To keep this problem manageable, the placement of stones...
You should be an authorized user in order to see the full description and start solving this mission.
