Sokoban: Improving the search with relevance cuts

DOI10.1016/S0304-3975(00)00080-3zbMATH Open0954.68058MaRDI QIDQ1589512FDOQ1589512

Authors: A. Junghanns, Jonathan Schaeffer 

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1784976
• Learning heuristic functions for large state spaces
• Sokoban: Enhancing general single-agent search methods using domain knowledge
• Automatic move pruning for single-agent search
• Difficulty rating of Sokoban puzzle

zbMATH Keywords

local searchheuristic searchSokobansingle-agent searchIDA*

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• SOKOBAN and other motion planning problems
• Title not available (Why is that?)
• Best-first fixed-depth minimax algorithms
• Depth-first iterative-deepening: An optimal admissible tree search
• Macro-operators: A weak method for learning

Cited In (6)

• Sokoban: Enhancing general single-agent search methods using domain knowledge
• Difficulty rating of Sokoban puzzle
• Zen puzzle garden is NP-complete
• Title not available (Why is that?)
• A genetic algorithm for the zen puzzle garden game
• Title not available (Why is that?)

This page was built for publication: Sokoban: Improving the search with relevance cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589512)