Paradise

**[[Home]] * [[Engines]] * Paradise**
|| [[image:Jan_Bruegel_d_Ae.jpg link="http://en.wikipedia.org/wiki/File:Jan_Bruegel_d._%C3%84._003.jpg"]] ||~ || **Paradise**, (**Pa**ttern **r**ecognition **a**pplied to **di**recting **se**arch)
a [[Knowledge|knowledge]] based chess program written at [[Stanford University]] in the late 70s by [[David Wilkins]]. Paradise was written in [[http://en.wikipedia.org/wiki/Maclisp|MacLisp]], a dialect of the [[Lisp]] programming language  developed at [[Massachusetts Institute of Technology|MIT]] within [[http://en.wikipedia.org/wiki/MIT_Computer_Science_and_Artificial_Intelligence_Laboratory#Project_MAC|Project MAC]]. Paradise' goal was to find the [[Best Move|best move]] in [[Tactics|tactically]] sharp [[Middlegame|middlegame]] [[Chess Position|positions]] from the [[Chess Game|game]] of chess masters. 

Like human players, the program had a large number of stored "patterns", and analyzing a position involved matching these patterns to suggest [[Planning|plans]] for attack or defense. By communicating plans down the [[Search Tree|tree]], the analysis was verified and possibly corrected by a small [[Search|search]] of the game tree (tens of positions) inluding specialized causality facility and [[Quiescence Search|quiescence search]] <ref>[[http://www.stmintz.com/ccc/index.php?id=348861|Comparison: Paradise and Symbolic]] by [[Steven Edwards]], [[CCC]], February 13, 2004</ref>. There were production rules to produce plans, implementing such concepts as [[Checkmate|checkmate]], [[Double Attack|fork]], [[Skewer|skewer]], and [[Trapped Pieces|trapping]] the piece, etc.. A plan generator produced tactical plans in a Plan Language. The program is capable of finding very deep combinations because no limit is placed on its search depth. It searches for moves as long as a plan is continuing to work <ref> [[Tristan Caulfield]] (**2004**). //Acquiring and Using Knowledge in Computer Chess//. BSc Computer Science, [[http://en.wikipedia.org/wiki/University_of_Bath|University of Bath]], [[http://opus.bath.ac.uk/16854/1/CSBU|pdf]], 4.2.2 PARADISE, pp. 12</ref>.

While Paradise was able to solve most of 92 positions picked from the first 100 from [[Win at Chess]], with averaged three minutes thirty-three seconds for each solved position on a [[PDP-10]] <ref>[[http://www.stmintz.com/ccc/index.php?id=312389|Re: Paradise performance]] by [[Steven Edwards]], [[CCC]], August 22, 2003</ref>, it was not able to play a complete reasonable game of chess due not further implemented knowledge employable in [[Strategy|strategic]], none-tactical positions, especially during the [[Endgame|endgame]]. Controlling the search by [[Pattern Recognition|recognizers]], i.e. the amount to [[Extensions|extend]] or to [[Reductions|reduce]] if a move is accordant to a plan or not is still hot topic. 
||
|| Paradise by [[http://en.wikipedia.org/wiki/Jan_Brueghel_the_Younger|Jan Brueghel the Younger]] <ref>Paradise by [[http://en.wikipedia.org/wiki/Jan_Brueghel_the_Younger|Jan Brueghel the Younger]] (c. 1620). Oil on oak. [[http://en.wikipedia.org/wiki/Gem%C3%A4ldegalerie,_Berlin|Gemäldegalerie, Berlin]], [[http://en.wikipedia.org/wiki/Paradise|Paradise from Wikipedia]]</ref> ||~ ||^ ||
[[toc]]
=See also=
* [[CAPS]]
* [[Eden]]
* [[Knowledge]]
* [[Various Classifications#Mythology|Mythology]]
* [[Pattern Recognition]]
* [[Planner]]
* [[Planning]]
* [[Symbolic]]

=Publications=
<ref>[[http://www.ai.sri.com/~wilkins/bib-chess.html|Papers on Chess by David E. Wilkins]]</ref>
* [[David Wilkins]] (**1979**). //Using Patterns and Plans to Solve Problems and Control Search//. Ph.D. thesis, Computer Science Dept, [[Stanford University]], AI Lab Memo AIM-329
* [[David Wilkins]] (**1980**). //Using patterns and plans in chess//. [[http://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29|Artificial Intelligence]], vol. 14, pp. 165-203. Reprinted (**1988**) in [[Computer Chess Compendium]]
* [[David Wilkins]] (**1982**). //Using Knowledge to Control Tree Searching//. [[http://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29|Artificial Intelligence]], vol. 18, pp. 1-51.
* [[David Wilkins]] (**1983**). //Using chess knowledge to reduce search//. In [[Chess Skill in Man and Machine]] ([[Peter W. Frey]], ed.), Ch. 10, 2nd Edition, Springer-Verlag.
* [[Tony Marsland]] (**1987**). //Computer Chess Methods.// Encyclopedia of Artificial Intelligence (ed. S. Shapiro). John Wiley & sons, New York. [[http://webdocs.cs.ualberta.ca/~tony/OldPapers/encyc.mac.pdf|pdf draft]], mentions Paradise on pp. 27
* [[David Wilkins]] (**1991**). //Working notes on Paradise chess patterns//. Technical Note 509, AI Center, SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, [[http://www.ai.sri.com/pubs/files/465.pdf|pdf]]
* [[http://fi.wikipedia.org/wiki/Jussi_Tella|Jussi Tella]] (**1997**). //[[http://www.cs.hut.fi/~sto/planning-seminaari/tella/planning-in-games.htm#22|Planning in Games]]//. Seminar on Knowledge Engineering, Fall 1997, [[http://en.wikipedia.org/wiki/Helsinki_University_of_Technology|Helsinki University of Technology]]
* [[Eric B. Baum]] (**2004**). //[[http://www.whatisthought.com/|What is Thought?]]//  Bradford Book, ISBN-13: 978-0262025485, Paradise mentioned at pp. 193
* [[Tristan Caulfield]] (**2004**). //Acquiring and Using Knowledge in Computer Chess//. BSc Computer Science, [[http://en.wikipedia.org/wiki/University_of_Bath|University of Bath]], [[http://opus.bath.ac.uk/16854/1/CSBU|pdf]], 4.2.2 PARADISE, pp. 12
* [[Diego Rasskin-Gutman]] (**2009**). //[[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11847|Chess Metaphors - Artificial Intelligence and the Human Mind]]//. ISBN-13: 978-0-262-18267-6, translated by [[http://mitpress.mit.edu/catalog/author/default.asp?aid=36831|Deborah Klosky]], [[http://en.wikipedia.org/wiki/MIT_Press|MIT Press]], 5 Chess Metaphors: Searches and Heuristics, pp. 125, Paradise pp. 136

=Forum Posts=
* [[https://groups.google.com/forum/?hl=de&fromgroups#!topic/rec.games.chess/LyMZ49kd9-o|Wilkins' PARADISE etc.]] by [[Nicolai Czempin]], [[Computer Chess Forums|rgc]], November 11, 1989
* [[http://www.stmintz.com/ccc/index.php?id=51|PARADISE 2]] by Trefor Deane, [[CCC]], July 04, 1998
* [[http://www.stmintz.com/ccc/index.php?id=312384|Paradise performance]] by [[Steven Edwards]], [[CCC]], August 22, 2003
* [[http://www.stmintz.com/ccc/index.php?id=348861|Comparison: Paradise and Symbolic]] by [[Steven Edwards]], [[CCC]], February 13, 2004 » [[Symbolic]]

=External Links=
* [[http://en.wikipedia.org/wiki/Paradise_%28disambiguation%29|Paradise (disambiguation) from Wikipedia]]
* [[http://en.wikipedia.org/wiki/Paradise|Paradise from Wikipedia]]
* [[http://en.wikipedia.org/wiki/Paradise_garden|Paradise garden from Wikipedia]]
* [[http://en.wikipedia.org/wiki/Garden_of_Eden|Garden of Eden from Wikipedia]]
* [[http://en.wikipedia.org/wiki/Paradiso|Paradiso (disambiguation) from Wikipedia]]
* [[http://en.wikipedia.org/wiki/Paradise_Lost|Paradise Lost from Wikipedia]]
* [[Videos#MarcusMiller|Marcus Miller]] - [[http://en.wikipedia.org/wiki/Free_%28Marcus_Miller_album%29|Blast]], [[http://en.wikipedia.org/wiki/Paradiso_%28Amsterdam%29|Paradiso]], [[http://en.wikipedia.org/wiki/Amsterdam|Amsterdam]] 2007, [[http://en.wikipedia.org/wiki/YouTube|YouTube]] Video
> [[https://sites.google.com/site/pittsburghmusichistory/pittsburgh-music-story/instrumentalists/poogie-bell|Poogie Bell]], [[http://www.presonus.com/community/artists/Bobby-Sparks|Bobby Sparks]], [[http://en.wikipedia.org/wiki/Keith_Anderson_%28saxophonist%29|Keith Anderson]], [[http://www.patchesstewart.com/indexflash.html|Patches Stewart]], [[http://en.wikipedia.org/wiki/Gr%C3%A9goire_Maret|Grégoire Maret]]
> [[media type="custom" key="23621576"]]

=References=
<references />
=What links here?=
[[include page="Paradise" component="backlinks" limit="40" ]]
**[[Engines|Up one Level]]**