Sokoban: Enhancing general single-agent search methods using domain knowledge

作者:

摘要

Artificial intelligence (AI) research has developed an extensive collection of methods to solve state-space problems. Using the challenging domain of Sokoban, this paper studies the effect of general search enhancements on program performance. We show that the current state of the art in AI generally requires a large research and programming effort to use domain-dependent knowledge to solve even moderately complex problems in such difficult domains. The application of domain-specific knowledge to exploit properties of the search space can result in large reductions in the size of the search tree, often several orders of magnitude per search enhancement. This application-specific knowledge is discovered and applied using application-independent search enhancements. Understanding the effect of these enhancements on the search leads to a new taxonomy of search enhancements, and a new framework for developing single-agent search applications. This is used to illustrate the large gap between what is portrayed in the literature versus what is needed in practice.

论文关键词:Single-agent search,IDA∗,Sokoban,Transposition table,Pattern search,Pattern database,Rapid random restart

论文评审过程:Received 16 February 2000, Available online 10 December 2001.

论文官网地址:https://doi.org/10.1016/S0004-3702(01)00109-6