Macro-operators: a weak method for learning
Artificial Intelligence - Lecture notes in computer science 178
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
A world championship caliber checkers program
Artificial Intelligence
Artificial Intelligence
Exploiting algebraic structure in parallel state space search
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
BIDA: an improved perimeter search algorithm
Artificial Intelligence
Machine Discovery of Effective Admissible Heuristics
Machine Learning
Searching with Pattern Databases
AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Planning and learning in permutation groups
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
How to use limited memory in heuristic search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Complexity analysis admissible heuristic search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Single-agent search in the presence of deadlocks
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A space-time tradeoff for memory-based heuristics
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Transposition table driven work scheduling in distributed search
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Computer Go: an AI oriented survey
Artificial Intelligence
Games, computers and artificial intelligence
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Functional strips: a more flexible language for planning and problem solving
Logic-based artificial intelligence
A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
IEEE Transactions on Parallel and Distributed Systems
Planning and Control in Artificial Intelligence: A Unifying Perspective
Applied Intelligence
IEEE Intelligent Systems
Recent Progress in the Design and Analysis of Admissible Heuristic Functions
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Experiments with Automatically Created Memory-Based Heuristics
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Searching for Macro Operators with Automatically Generated Heuristics
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Relevance Cuts: Localizing the Search
CG '98 Proceedings of the First International Conference on Computers and Games
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
CG '00 Revised Papers from the Second International Conference on Computers and Games
Review: Computer Language Games
CG '00 Revised Papers from the Second International Conference on Computers and Games
Prediction of Regular Search Tree Growth by Spectral Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
On the diameter of the symmetric group: polynomial bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the diameter of Eulerian orientations of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding optimal solutions to the graph partitioning problem with heuristic search
Annals of Mathematics and Artificial Intelligence
Evolution of Cooperative Problem Solving in an Artificial Economy
Neural Computation
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
Duality in permutation state spaces and the dual search algorithm
Artificial Intelligence
Rubik's cube reconstruction from single view for Service robots
Machine Graphics & Vision International Journal
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Active Learning of Group-Structured Environments
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Scaling Search with Pattern Databases
Model Checking and Artificial Intelligence
Relaxation Refinement: A New Method to Generate Heuristic Functions
Model Checking and Artificial Intelligence
GP-rush: using genetic programming to evolve solvers for the rush hour puzzle
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Space-efficient memory-based heuristics
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Dual search in permutation state spaces
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Analyzing the performance of pattern database heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Predicting the performance of IDA* with conditional distributions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
Additive pattern database heuristics
Journal of Artificial Intelligence Research
The generalized A* architecture
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
Domain-dependent single-agent search enhancements
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Faster heuristic search algorithms for planning with uncertainty and full feedback
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Dual lookups in pattern databases
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Limited discrepancy beam search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
FAHR: focused A* heuristic recomputation
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Models of active learning in group-structured state spaces
Information and Computation
Combining perimeter search and pattern database abstractions
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Computing and using lower and upper bounds for action elimination in MDP planning
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The computational complexity of avoiding spurious states in state space abstraction
Artificial Intelligence
Relative-Order Abstractions for the Pancake Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
Artificial intelligence search algorithms
Algorithms and theory of computation handbook
Inconsistent heuristics in theory and practice
Artificial Intelligence
GA-FreeCell: evolving solvers for the game of FreeCell
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Generating admissible heuristics by abstraction for search in stochastic domains
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Hierarchical heuristic search revisited
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Solving the 24 puzzle with instance dependent pattern databases
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Experiments with multiple abstraction heuristics in symbolic verification
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Efficient memory bound puzzles using pattern databases
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Learning heuristic functions for large state spaces
Artificial Intelligence
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
A genetic algorithm for the Zen Puzzle Garden game
Natural Computing: an international journal
The increasing cost tree search for optimal multi-agent pathfinding
Artificial Intelligence
Predicting the size of IDA*'s search tree
Artificial Intelligence
Computing upper bounds on lengths of transition sequences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We have found the first optimal solutions to random instances of Rubik's Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterative-deepening-A* (IDA*), with a lower-bound heuristic function based on large memory-based lookup tables, or "pattern databases" (Culberson and Schaeffer 1996). These tables store the exact number of moves required to solve various subgoals of the problem, in this case subsets of the individual movable cubies. We characterize the effectiveness of an admissible heuristic function by its expected value, and hypothesize that the overall performance of the program obeys a relation in which the product of the time and space used equals the size of the state space. Thus, the speed of the program increases linearly with the amount of memory available. As computer memories become larger and cheaper, we believe that this approach will become increasingly cost-effective.