Journal of the ACM (JACM)
Sokoban: improving the search with relevance cuts
Theoretical Computer Science
An Introduction to the Theory of Computation
An Introduction to the Theory of Computation
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machines, Languages and Computation
Machines, Languages and Computation
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Making of Sokoban Problems
PRICAI '96 Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
The complexity of checkers on an N × N board
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Computational aspects of the Post Correspondence Problem (PCP) are studied. Specifically, we describe our efforts to find difficult instances of the PCP, where a "difficult" instance is defined to mean an instance whose shortest solution is long. As a result, we attempt to quantify the difficulty of the PCP in the same way the Busy Beaver Problem does for the Turing Halting Problem. We find instances of the PCP that have quite long solutions even when the number of pairs and the length of the strings is small, e.g., four and three, respectively. We discuss algorithms for solving the PCP and for generating difficult PCP instances. This problem poses unique difficulties because the size of the search space is unbounded.