{"type":"ScholarlyArticle","title":"Efficient belief-state AND-OR search, with application to Kriegspiel","authors":[{"name":"Stuart J. Russell","slug":"stuart-j-russell","given":"Stuart J.","family":"Russell","affiliation":""},{"name":"Jason Andrew Wolfe","slug":"jason-andrew-wolfe","given":"Jason Andrew","family":"Wolfe","affiliation":""}],"abstract":"The paper reports on new algorithms for solving partially observable games. Whereas existing algorithms apply AND-OR search to a tree of blackbox belief states, our “incremental” versions treat uncertainty as a new search dimension, examining the physical states within a belief state to construct solution trees incrementally. On a newly created database of checkmate problems for Kriegspiel (a partially observable form of chess), incrementalization yields speedups of two or more orders of magnitude on hard instances.","doi":null,"url":"https://ijcai.org/proceedings/2005/110","pdf":"https://ijcai.org/proceedings/2005/0110.pdf","markdown":"https://ijcai.org/proceedings/2005/110.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/110","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":110,"pages":{"first":278,"last":284},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}