Automatic move pruning for single-agent search

DOI10.3233/AIC-140605MaRDI QIDQ2811233zbMATH OpenFDO

Authors Robert C. Holte, Neil Burch

Publication date 10 June 2016

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/AIC-140605

zbMATH Keywords

heuristic searchmove pruningsinge-agent search problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Recommendations

• scientific article; zbMATH DE number 1784976
• Sokoban: Enhancing general single-agent search methods using domain knowledge
• Automatic complexity reduction in reinforcement learning
• Pruning algorithms for multi-model adversary search
• scientific article; zbMATH DE number 1696544
• Unifying single-agent and two-player search
• scientific article; zbMATH DE number 1045316

Cited in

(1)

• Sokoban: Improving the search with relevance cuts

This page was built for publication: Automatic move pruning for single-agent search

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