A first-person maze with one way through. Along it, twelve stations: 1950 Turing asks the question, 1956 Dartmouth names the field, 1997 Deep Blue, 2017 the transformer, 2022 ChatGPT. The map and the stations live in a contract on Robinhood Chain. Your browser reads them out of chain state, you walk, and every cell you cross is a move. At the exit you hand the moves to the contract: it walks them over its own map, refuses a step into a wall or a station out of order, and records you.
31 × 31 cells, one byte each, 961 bytes in contract storage. Carved by a seeded backtracker, so the maze is perfect: exactly one path from the entrance to the exit, no loops. The twelve stations sit on that path, spaced along it, which is why they can only be reached in order.
Each cell you cross is one byte: 0 up, 1 right, 2 down, 3 left. Wandering into dead ends adds moves. The clean solution is 260 moves; fewer is impossible.
verify(moves) walks the bytes over the stored map inside the EVM and returns whether it finished, how many steps, how many stations were passed and where it stopped. submit(moves) records a finish and a personal best; the fewest steps by anyone is the record. Nothing else is stored.
One contract, no owner, no setters, nothing to withdraw. The map cannot change after deployment. Tested on a fork of Robinhood Chain mainnet: the solution verifies, a detour verifies with more steps, a step into a wall, off the edge, a skipped first move, an empty run and a run over 6,000 moves are all refused, personal bests and the record update the way the docs say.
Buy on Pons