MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A New Self-Play Experiment in Computer Chess

Author(s)
Heinz, Ernst
Thumbnail
DownloadMIT-LCS-TM-608.pdf (1.138Mb)
Metadata
Show full item record
Abstract
This paper presents the results of a new self-play experiment in computer chess. It is the _x000C_rst such experiment ever to feature search depths beyond 9 plies and thousands of games for every single match. Overall, we executed 17,150 self-play games (1,050{3,000 per match) in one \\calibration" match and seven \\depth X+1 , X" handicap matches at _x000C_xed iteration depths ranging from 5{12 plies. For the experiment to be realistic and independently repeatable, we relied on a state-of-the-art commercial contestant: Fritz 6 , one of the strongest modern chess pro- grams available. The main result of our new experimentis thatit shows the existence of diminishing returns for additional search in computer chess self-play by Fritz 6 with 95% statistical con_x000C_dence. The dimin- ishing returns manifest themselves by declining rates of won games and reversely increasing rates of drawn games for the deeper searching pro- gram versions. The rate of lost games, however, remains quite steady for the whole depth range of 5{12 plies.
Date issued
2000-05
URI
https://hdl.handle.net/1721.1/149298
Series/Report no.
MIT-LCS-TM-608

Collections
  • LCS Technical Memos (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.