Author: Matthew Hull
Date: 10:39:36 02/19/04
Go up one level in this thread
On February 19, 2004 at 13:25:20, Steven Edwards wrote: >Symbolic Project Goals (required): > >1. Produce a chess playing program in Lisp with assistance of C++ support of low >level chess intrinsics. > >2. Portability (platform language independence): only ANSI C++ required. > >3. Portability (platform runtime independence): only a terminal emulator and >POSIX conformance (including the pthread library). Linux and OpenBSD are >explicitly supported. > >4. Portability (Lisp dialect independence): All chess specific intrinsics can be >ported to a regular Common Lisp environment. > >5. Limitation of the seach node count to a mean of one thousand. While this by >itself is not a sufficient condition to prove human-like reasoning, it is a >necessary one. > >6. Explicit and extensive use of pattern matching. > >7. Explicit and extensive use of planning. > >8. Natural language output including construction of a search narrative >describing the reasoning used for a particular search. This will constitute >proof that the program is not just an interative A/B searcher in disguise. > >9. The capability to interactively replay the planning/search process. > >10. To perform a search with a mean time of less than one minute. > >11. To operate on modest hardware such as a 400 MHz PPC with 256 MByte RAM and >10 GByte disk. > >12. To be able to solve at least two thirds of the problems on some common EPD >test suites. > >13. To incorporate the various CNS (Chess Notation Standards) specifications. > >14. To incorporate tablebases. > >15. To incorporate an extensive opening library. > >16. To be able to use an ANSI standard terminal emulator for a user interface. > >17. To be able to use natural language spoken output on some platforms. > >18. To play in human events under standard USCF rules (dependent upon the >availablity of USCF tournaments allowing program participation). > >19. To achieve a rating of at least 1800 Elo against humans (again, dependent >upon the availablity of tournaments). > >20. Support for automated play against itself or against other programs where a >suitable interface is available. > > >Symbolic Project Goals (optional, long-term): > >1. To have an automated learning facility that incorporates persistant plan and >pattern libraries. > >2. To have support for interactive tutoring of the program. > >3. To have support for interactive tutoring of the user. This item has definite >commercial possibilities. > >4. To be able to use natural language spoken input on some platforms (HAL 9000 >mode). > >5. To produce a QuickTime or MPEG movie of the details of a search. > >6. To be able to solve at least nine tenths of the problems on some common EPD >test suites. > >7. To play at master level (2200 Elo) or better (dependent upon the availablity >of tournaments). > >8. To be able to intelligently annotate PGN game scores. (Another commercial >possibility.) > >9. To have search tunability that retains the mean search node count independent >of platform speed or the time control. > >10. To be able to construct a predictive model of an opponent's play. > >11. To be able to pre-calculate and store opening plans and associate them with >the opening library. > >12. Incorporation of a humorous praise/insult facility to amuse the user. > >13. To port the program (or most of its functionality) to a modest hand held >device (e.g., my iPAQ). > >14. To support certain chess hardware peripherals (e.g., autosensing boards, >robotic arms, clocks). > >15. To include a kibbutz facility. > >16. To include a GUI for Mac OS X. > >17. To include a GUI for X Windows. > >18. To produce a version in German. > >19. To reduce the mean node count to under one hundred. > >20. To become World Champion. How soon until it can play it's first legal game of chess?
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.