论文信息 - SEARCH PATHOLOGY OF 8-PUZZLE

SEARCH PATHOLOGY OF 8-PUZZLE

8-puzzle is typically solved by heuristic search. Real-time heuristic search usually gives better results when searching deeper. But sometimes deeper search leads to worse results than shallower which is a phenomenon called search pathology. In this paper we present the results of our investigation of the causes for pathology in 8-puzzle and some of its variations.

M. Gams | M. Luštrek | Rok Piltaver

[1] Dana S. Nau,et al. Quality of decision versus depth of search on game trees , 1979 .

[2] Ken Thompson,et al. Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[3] Alexander Reinefeld,et al. Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA , 1993, IJCAI.

[4] Vadim Bulitko,et al. Lookahead Pathologies for Single Agent Search , 2003, IJCAI.

[5] Vadim Bulitko,et al. Lookahead Pathologies and Meta-level Control in Real-Time Heuristic Search , 2003 .

[6] Mitja Luštrek,et al. PATHOLOGY IN SINGLE-AGENT SEARCH , 2005 .

[7] Ivan Bratko,et al. Pessimistic Heuristics Beat Optimistic Ones in Real-Time Search , 2006, ECAI.