{"type":"ScholarlyArticle","title":"Using Plans in Chess","authors":[{"name":"David Wilkins","slug":"david-wilkins","given":"David","family":"Wilkins","affiliation":""}],"abstract":"The purpose of this research Is to Investigate the extent to which knowledge can replace and support search In selecting a chess move and to delineate the Issues involved. This has been carried out by constructing a program, PARADI SE (PAttern Recognition Applied to Directing SEarch), which finds the best move In tactically sharp middle game position s. It encodes a large body of knowledge In the form of production rules. The program uses the knowledge base to discover plans during static analysis and to guide a small (tens of nodes) tree search. PARADISE does not place a depth limit on the search (or any other artificial effort limit), and has found combination. as deep as 19 ply. This paper describes J>lans , how they are produced, and how they are used to guide the search . A complete description of PARADISE appears In (12)","doi":null,"url":"https://ijcai.org/proceedings/1979/211","pdf":"https://ijcai.org/proceedings/1979/0211.pdf","markdown":"https://ijcai.org/proceedings/1979/211.md","bibtex":"https://ijcai.org/proceedings/1979/bibtex/211","volume":{"slug":"1979","title":"Proceedings of the Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1979","url":"https://ijcai.org/proceedings/1979/","year":1979,"location":"Tokyo, Japan","dates":"August 20-23, 1979","editors":"Bruce G. Buchanan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":211,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}