Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
The (n2-1)-puzzle and related relocation problems
Journal of Symbolic Computation
Criticizing solutions to relaxed models yields powerful admissible heuristics
Information Sciences: an International Journal
The branching factor of regular search spaces
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Limits and Possibilities of Automated Protocol Analysis
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Efficient Memory-Limited Graph Search
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Assembling molecules in ATOMIX is hard
Theoretical Computer Science - Algorithmic combinatorial game theory
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
SPIN'03 Proceedings of the 10th international conference on Model checking software
Guided Model Checking with a Bayesian Meta-heuristic
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Hi-index | 0.00 |
We present solutions of benchmark instances to the solitaire computer game Atomix found with different heuristic search methods. The problem is PSPACE-complete. An implementation of the heuristic algorithm A* is presented that needs no priority queue, thereby having very low memory overhead. The limited memory algorithm IDA* is handicapped by the fact that, due to move transpositions, duplicates appear very frequently in the problem space; several schemes of using memory to mitigate this weakness are explored, among those, "partial" schemes which trade memory savings for a small probability of not finding an optimal solution. Even though the underlying search graph is directed, backward search is shown to be viable, since the branching factor can be proven to be the same as for forward search.