Difference between revisions of "TSCP"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 4: | Line 4: | ||
'''TSCP''',<br/> | '''TSCP''',<br/> | ||
− | Tom's Simple Chess Program has been written by [[Tom Kerrigan]] in 1997 as a device to show the basics of the chess programming. On its home page <ref>[http://www.tckerrigan.com/Chess/TSCP TSCP - from Tom Kerrigan's Home Page]</ref> one can find not only the program itself, but also a couple of derivatives, like a version with [[Null Move Pruning|null move pruning]] or with a [[Bitboards|bitboard]] move generator. TSCP 1.81 was the test engne in [[Henk Mannen|Mannen's]] and [[Marco Wiering|Wiering's]] computer chess learning experiments, where they trained several different chess [[Evaluation|evaluation]] functions ([[Neural Networks|neural networks]]) by using [[Temporal Difference Learning|TD(λ) learning]] on a set of database games, published in 2004/05 <ref>[[Henk Mannen]], [[Marco Wiering]] ('''2004'''). ''[ | + | Tom's Simple Chess Program has been written by [[Tom Kerrigan]] in 1997 as a device to show the basics of the chess programming. On its home page <ref>[http://www.tckerrigan.com/Chess/TSCP TSCP - from Tom Kerrigan's Home Page]</ref> one can find not only the program itself, but also a couple of derivatives, like a version with [[Null Move Pruning|null move pruning]] or with a [[Bitboards|bitboard]] move generator. TSCP 1.81 was the test engne in [[Henk Mannen|Mannen's]] and [[Marco Wiering|Wiering's]] computer chess learning experiments, where they trained several different chess [[Evaluation|evaluation]] functions ([[Neural Networks|neural networks]]) by using [[Temporal Difference Learning|TD(λ) learning]] on a set of database games, published in 2004/05 <ref>[[Henk Mannen]], [[Marco Wiering]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Learning-to-Play-Chess-using-TD(lambda)-learning-Mannen-Wiering/00a6f81c8ebe8408c147841f26ed27eb13fb07f3 Learning to play chess using TD(λ)-learning with database games]''. Cognitive Artificial Intelligence, [https://en.wikipedia.org/wiki/Utrecht_University Utrecht University], Benelearn’04, [https://www.ai.rug.nl/~mwiering/GROUP/ARTICLES/learning-chess.pdf pdf]</ref> <ref>[[Marco Wiering]], [https://dblp.org/pid/20/4400.html Jan Peter Patist], [[Henk Mannen]] ('''2005'''). ''[https://www.semanticscholar.org/paper/Learning-to-Play-Board-Games-using-Temporal-Methods-Wiering-Patist/7410e2bf16ed184db89f0e3acbbfdad473623b7a Learning to Play Board Games using Temporal Difference Methods]''. Technical Report, [https://en.wikipedia.org/wiki/Utrecht_University Utrecht University], UU-CS-2005-048, [http://webdoc.sub.gwdg.de/ebook/serien/ah/UU-CS/2005-048.pdf pdf]</ref>. |
=Features= | =Features= | ||
Line 16: | Line 16: | ||
** [[History Heuristic]] | ** [[History Heuristic]] | ||
** [[Triangular PV-Table]] | ** [[Triangular PV-Table]] | ||
− | ** [[SCP#Repetitions|Repetition detection]] <ref>detects false repetitions in case of exchanging two unequal pieces, also used in [[Belzebub]], credited to [[SCP]] and [[GNU Chess]] by [[John Stanback]]</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=119911 Re: Detecting three-fold repetition?] by [[John Stanback]], [[CCC]], July 17, 2000</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Bala Jr.]], [[CCC]], November 05, 2012</ref> | + | ** [[SCP#Repetitions|Repetition detection]] <ref>detects false repetitions in case of exchanging two unequal pieces, also used in [[Belzebub]], credited to [[SCP]] and [[GNU Chess]] by [[John Stanback]]</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=119911 Re: Detecting three-fold repetition?] by [[John Stanback]], [[CCC]], July 17, 2000</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], November 05, 2012</ref> |
* [[Evaluation]] <ref>[https://jim.sh/svn/jim/vendor/microwindows/current/src/demos/tuxchess/eval.c TSCP - eval.c]</ref> | * [[Evaluation]] <ref>[https://jim.sh/svn/jim/vendor/microwindows/current/src/demos/tuxchess/eval.c TSCP - eval.c]</ref> | ||
** [[Material#Balance|Material Balance]] | ** [[Material#Balance|Material Balance]] | ||
Line 46: | Line 46: | ||
=See also= | =See also= | ||
* [[MSCP]] | * [[MSCP]] | ||
+ | * [[PeSTO's Evaluation Function]] | ||
* [[SCP]] | * [[SCP]] | ||
Line 73: | Line 74: | ||
* [http://www.talkchess.com/forum/viewtopic.php?t=57730 Symbolic vs tscp: 1,000 game match results] by [[Steven Edwards]], [[CCC]], September 23, 2015 » [[Symbolic]] | * [http://www.talkchess.com/forum/viewtopic.php?t=57730 Symbolic vs tscp: 1,000 game match results] by [[Steven Edwards]], [[CCC]], September 23, 2015 » [[Symbolic]] | ||
* [http://www.talkchess.com/forum/viewtopic.php?t=57776 Symbolic vs tscp: more match results] by [[Steven Edwards]], [[CCC]], September 28, 2015 | * [http://www.talkchess.com/forum/viewtopic.php?t=57776 Symbolic vs tscp: more match results] by [[Steven Edwards]], [[CCC]], September 28, 2015 | ||
+ | ==2020 ...== | ||
+ | * [https://prodeo.actieforum.com/t252-little-fun-with-tscp little fun with TSCP] by [[Pawel Koziol|nescitus]], [[Computer Chess Forums|ProDeo Forum]], February 12, 2021 » [[PeSTO's Evaluation Function]] | ||
=External Links= | =External Links= | ||
Line 95: | Line 98: | ||
[[Category:Acronym]] | [[Category:Acronym]] | ||
[[Category:CP Suffix]] | [[Category:CP Suffix]] | ||
+ | [[Category:Didactic]] |
Latest revision as of 09:51, 15 April 2021
TSCP,
Tom's Simple Chess Program has been written by Tom Kerrigan in 1997 as a device to show the basics of the chess programming. On its home page [2] one can find not only the program itself, but also a couple of derivatives, like a version with null move pruning or with a bitboard move generator. TSCP 1.81 was the test engne in Mannen's and Wiering's computer chess learning experiments, where they trained several different chess evaluation functions (neural networks) by using TD(λ) learning on a set of database games, published in 2004/05 [3] [4].
Contents
Features
Licensing
TSCP is open source, but does not fall under GPL or similar licenses, which means that any derivative work must be approved by the author and most likely should not become open source, as it would open the path for violating author's copyright.
Legal derivatives
Clones
(as listed by author) [12]
- KasparovX
- Squash
- Replicant
- Tuxedo
See also
Forum Posts
1997 ...
- Tom Kerrigan's Simple Chess Program by Bruce Moreland, rgcc, August 13, 1997
- New version of TSCP! by Tom Kerrigan, CCC, August 02, 1998
- TSCP derivatives? by Tom Kerrigan, CCC, August 06, 1998
- Even more simple chess program :-) by Eugene Nalimov, CCC, June 25, 1999
- Other programs like TSCP, SCP, and MSCP? by Pete Galati, CCC, August 11, 1999
- NEW VERSION OF TSCP (1.4) by Tom Kerrigan, CCC, December 06, 1999
2000 ...
- NEW VERSION OF TSCP (1.5) by Tom Kerrigan, CCC, February 14, 2000
- Detecting three-fold repetition? by Tom Kerrigan, CCC, July 17, 2000 » Repetitions
- Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000 » SCP Repetition detection
- Finally, repetition detection! TSCP 1.6 is now available! by Tom Kerrigan, CCC, July 17, 2000
- Delphi version of TSCP by Steve Maughan, CCC, December 18, 2000
- TSCP enhancements (Re: Short chess programs) by Ian Osgood, CCC, September 19, 2002
- New version of TSCP (1.8)--opening book and hash keys by Tom Kerrigan, CCC, January 30, 2003
- Looking for tweaked TSCP by Jean Efpraxiadis, CCC, June 01, 2003
- TSCP with bitboards by Russell Reagan, CCC, June 01, 2003
2010 ...
- Movei, The Baron, and TSCP by Uri Blass, CCC, January 23, 2014 » Movei, The Baron
- The Baron and TSCP by Richard Pijl, CCC, January 27, 2014
- A bugfix for TSCP by Steven Edwards, CCC, August 20, 2015
- Editing tscp by Steven Edwards, CCC, August 24, 2015
- Symbolic vs tscp: 1,000 game match results by Steven Edwards, CCC, September 23, 2015 » Symbolic
- Symbolic vs tscp: more match results by Steven Edwards, CCC, September 28, 2015
2020 ...
- little fun with TSCP by nescitus, ProDeo Forum, February 12, 2021 » PeSTO's Evaluation Function
External Links
- TSCP - from Tom Kerrigan's Home Page
- jim - Revision 5535: /vendor/microwindows/current/src/demos/tuxchess
- Tom Kerrigan's Simple Chess Program (TSCP) README Copyright 1997 Tom Kerrigan
- Tscp 1.81 in CCRL 40/4
References
- ↑ Simplicius Simplicissimus Cover page, 1669 by Hans Jakob Christoffel von Grimmelshausen, The adventurous Simplicissimus : being the description of the life of a strange vagabond named Melchior Sternfels von Fechshaim : Grimmelshausen, Hans Jakob Christoph von, 1625-1676, Free Download & Streaming : Internet Archive
- ↑ TSCP - from Tom Kerrigan's Home Page
- ↑ Henk Mannen, Marco Wiering (2004). Learning to play chess using TD(λ)-learning with database games. Cognitive Artificial Intelligence, Utrecht University, Benelearn’04, pdf
- ↑ Marco Wiering, Jan Peter Patist, Henk Mannen (2005). Learning to Play Board Games using Temporal Difference Methods. Technical Report, Utrecht University, UU-CS-2005-048, pdf
- ↑ TSCP - data.c
- ↑ TSCP - board.c
- ↑ TSCP - search.c
- ↑ detects false repetitions in case of exchanging two unequal pieces, also used in Belzebub, credited to SCP and GNU Chess by John Stanback
- ↑ Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000
- ↑ Re: Move Tables - explain as if I'm five by Karlo Bala Jr., CCC, November 05, 2012
- ↑ TSCP - eval.c
- ↑ TSCP - from Tom Kerrigan's Home Page Hall of shame