Difference between revisions of "Paradise"

From Chessprogramming wiki
Jump to: navigation, search
Line 30: Line 30:
 
* [[David Wilkins]] ('''1982'''). ''Using Knowledge to Control Tree Searching''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18
 
* [[David Wilkins]] ('''1982'''). ''Using Knowledge to Control Tree Searching''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18
 
* [[David Wilkins]] ('''1983'''). ''Using chess knowledge to reduce search''. [[Chess Skill in Man and Machine]], Ch. 10, 2nd edition
 
* [[David Wilkins]] ('''1983'''). ''Using chess knowledge to reduce search''. [[Chess Skill in Man and Machine]], Ch. 10, 2nd edition
−
* [[Tony Marsland]] ('''1987'''). ''Computer Chess Methods.'' Encyclopedia of Artificial Intelligence, John Wiley & sons, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/encyc.mac.pdf pdf draft], mentions Paradise on pp. 27
+
* [[Tony Marsland]] ('''1987'''). ''[https://www.semanticscholar.org/paper/Computer-Chess-and-Search-Marsland/8f28b87e78e860d77d2f9173ddbfda7133a5b2d1 Computer Chess Methods].'' Encyclopedia of Artificial Intelligence, John Wiley & sons, mentions Paradise on pp. 27
 
* [[David Wilkins]] ('''1991'''). ''Working notes on Paradise chess patterns''. Technical Note 509, AI Center, SRI International, [http://www.ai.sri.com/pubs/files/465.pdf pdf]
 
* [[David Wilkins]] ('''1991'''). ''Working notes on Paradise chess patterns''. Technical Note 509, AI Center, SRI International, [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, [https://en.wikipedia.org/wiki/Helsinki_University_of_Technology Helsinki University of Technology]
 
* [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, [https://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, Paradise mentioned at pp. 193
 
* [[Eric B. Baum]] ('''2004'''). ''[http://www.whatisthought.com/ What is Thought?]''  Bradford Book, Paradise mentioned at pp. 193
−
* [[Tristan Caulfield]] ('''2004'''). ''Acquiring and Using Knowledge in Computer Chess''. B.Sc. Computer Science, [https://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
+
* [[Tristan Caulfield]] ('''2004'''). ''Acquiring and Using Knowledge in Computer Chess''. B.Sc. Computer Science, [https://en.wikipedia.org/wiki/University_of_Bath University of Bath], [http://www.cs.bath.ac.uk/~mdv/courses/CM30082/projects.bho/2003-4/TristanCaulfieldDissertation.pdf pdf], 4.2.2 PARADISE, pp. 12
 
* [[Diego Rasskin-Gutman]] ('''2009'''). ''[https://mitpress.mit.edu/books/chess-metaphors Chess Metaphors - Artificial Intelligence and the Human Mind]''. translated by Deborah Klosky, [https://en.wikipedia.org/wiki/MIT_Press MIT Press], 5 Chess Metaphors: Searches and Heuristics, pp. 125, Paradise pp. 136
 
* [[Diego Rasskin-Gutman]] ('''2009'''). ''[https://mitpress.mit.edu/books/chess-metaphors Chess Metaphors - Artificial Intelligence and the Human Mind]''. translated by Deborah Klosky, [https://en.wikipedia.org/wiki/MIT_Press MIT Press], 5 Chess Metaphors: Searches and Heuristics, pp. 125, Paradise pp. 136
  
Line 50: Line 50:
 
* [https://en.wikipedia.org/wiki/Paradiso Paradiso (disambiguation) from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Paradiso Paradiso (disambiguation) from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Paradise_Lost Paradise Lost from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Paradise_Lost Paradise Lost from Wikipedia]
−
* [[Videos#MarcusMiller|Marcus Miller]] - [https://en.wikipedia.org/wiki/Free_%28Marcus_Miller_album%29 Blast], [https://en.wikipedia.org/wiki/Paradiso_%28Amsterdam%29 Paradiso], [https://en.wikipedia.org/wiki/Amsterdam Amsterdam] 2007, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* [https://en.wikipedia.org/wiki/Sade_(singer) Sade] - [https://en.wikipedia.org/wiki/Paradise_(Sade_song) Paradise] (1987), [https://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], [https://en.wikipedia.org/wiki/Keith_Anderson_%28saxophonist%29 Keith Anderson], [http://www.patchesstewart.com/indexflash.html Patches Stewart], [https://en.wikipedia.org/wiki/Gr%C3%A9goire_Maret Grégoire Maret]
+
: {{#evu:https://www.youtube.com/watch?v=C0BLKudnyNo|alignment=left|valignment=top}}
−
: {{#evu:https://www.youtube.com/watch?v=GgG2r-3Ad9I|alignment=left|valignment=top}}
 
  
 
=References=
 
=References=

Revision as of 14:22, 21 June 2018

Home * Engines * Paradise

Paradise by Jan Brueghel the Younger [1]

Paradise, (Pattern recognition applied to directing search)
a knowledge based chess program written at Stanford University in the late 70s by David Wilkins. Paradise was written in MacLisp, a dialect of the Lisp programming language developed at MIT within Project MAC. Paradise' goal was to find the best move in tactically sharp middlegame positions from the game of chess masters.

Pattern and Plans

Like human players, the program had a large number of stored "patterns", and analyzing a position involved matching these patterns to suggest plans for attack or defense. By communicating plans down the tree, the analysis was verified and possibly corrected by a small search of the game tree (tens of positions) inluding specialized causality facility and quiescence search [2]. There were production rules to produce plans, implementing such concepts as checkmate, fork, skewer, and 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 [3].

Win at Chess

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 [4], it was not able to play a complete reasonable game of chess due not further implemented knowledge employable in strategic, none-tactical positions, especially during the endgame. Controlling the search by recognizers, i.e. the amount to extend or to reduce if a move is accordant to a plan or not is still hot topic.

See also

Publications

[5]

Forum Posts

External Links

References

  1. ↑ Paradise by Jan Brueghel the Younger (c. 1620). Oil on oak. Gemäldegalerie, Berlin, Paradise from Wikipedia
  2. ↑ Comparison: Paradise and Symbolic by Steven Edwards, CCC, February 13, 2004
  3. ↑ Tristan Caulfield (2004). Acquiring and Using Knowledge in Computer Chess. B.Sc. Computer Science, University of Bath, pdf, 4.2.2 PARADISE, pp. 12
  4. ↑ Re: Paradise performance by Steven Edwards, CCC, August 22, 2003
  5. ↑ Papers on Chess by David E. Wilkins

Up one Level

Retrieved from "https://www.chessprogramming.org/index.php?title=Paradise&oldid=4547"