What it does
The snake server pre-computes flood-fill reachability and Manhattan distance for every legal move, then lets Jev choose with that analysis in the state.
Playable demos & bots
Two small games, one decision-maker. In Snake, Jev picks a direction each tick from options the server has already checked for traps; in Sudoku, it fills in the most constrained cell one digit at a time.
Screenshot unavailable. Open the experiment ↗
The snake server pre-computes flood-fill reachability and Manhattan distance for every legal move, then lets Jev choose with that analysis in the state.
For your Sudoku puzzle, try filling one square at a time with AI help. Start with the empty square that has the fewest valid choices. This project's code sends the numbers already in that row, column and box to the AI. A developer can adapt that method for your puzzle.