The post correspondence problem is a well known problem in computer science theory field of study.
It's proved impossible to tell if a instance of a PCP problem is solvable or not in case of a loop.
The algorithm that runs in the game had to:
- Solve any (solvable) instance
- Generate solvable instances of the problem
- Classify a problem regarding the number of decisions a player has to make, and the lenght of the answer.
- Several non-deterministic programming techniques were used to avoid the 'halting problem'
The artwork for this project is poor, but the programming was challenging.