Table of contents:
After months of travel, you’ve arrived at Duonia, home to the famous temple that’s the destination of your pilgrimage. The walk from the welcome center to the temple is some blocks walking away, and you were handed the brochure about the city rules. This city is… unique, in that:
You just realized you did not bring any silver at all. Even worse, arriving at the welcome center already sets you back some silvers. As a pilgrim, you do not want to enter citizen’s blocks, nor break any rules. How would you reach the temple, located at the very lower-right intersection, without paying any tax?
In this project:
The game we researched is inspired by the video “Can you solve the penniless pilgrim riddle? - Daniel Finkel” of TED-Ed: https://youtu.be/6sBB-gRhfjE
The initial state of the game in the video
Its best solution we found using pure brute-force, which is considered better than the solution provided in the video
The tax fluctuate differently based on direction
One of the randomized initial states
The Penniless Pilgrim Riddle is performed by a mapping gameplay. We classify it as a problem solving by searching, specifically Single-state problem (The environment is known, observable, discrete and deterministic).
Help us to understand basic techniques of AI and advance more technical skills: building a program using Python, game developing, computational thinking, observation and statistics,...