---
title: "Using Plans in Chess"
authors:
  - "David Wilkins"
doi: ""
url: "https://ijcai.org/proceedings/1979/211"
pdf: "https://ijcai.org/proceedings/1979/0211.pdf"
venue: "Proceedings of the Sixth International Joint Conference on Artificial Intelligence"
year: 1979
pages: ""
track: ""
keywords:
---

# Using Plans in Chess

David Wilkins

*Proceedings of the Sixth International Joint Conference on Artificial Intelligence*.

## 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)