Difference between revisions of "TSCP"

From Chessprogramming wiki
Jump to: navigation, search
 
(5 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'''). ''[http://scholar.google.com/citations?view_op=view_citation&hl=en&user=xVas0I8AAAAJ&cstart=20&pagesize=80&citation_for_view=xVas0I8AAAAJ:7PzlFSSx8tAC Learning to play chess using TD(λ)-learning with database games]''. [http://students.uu.nl/en/hum/cognitive-artificial-intelligence Cognitive Artificial Intelligence], [https://en.wikipedia.org/wiki/Utrecht_University Utrecht University], Benelearn’04</ref> <ref>[[Marco Wiering]], [http://dblp.uni-trier.de/pers/hd/p/Patist:Jan_Peter Jan Peter Patist], [[Henk Mannen]] ('''2005'''). ''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://www.ai.rug.nl/~mwiering/GROUP/ARTICLES/learning_games_TR.pdf pdf]</ref>.  
+
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 88: Line 91:
 
[[Category:WinBoard]]
 
[[Category:WinBoard]]
 
[[Category:XBoard]]
 
[[Category:XBoard]]
 +
[[Category:X86]]
 
[[Category:Mac]]
 
[[Category:Mac]]
 +
[[Category:PC]]
 +
[[Category:Linux]]
 +
[[Category:Windows]]
 
[[Category:Acronym]]
 
[[Category:Acronym]]
 +
[[Category:CP Suffix]]
 +
[[Category:Didactic]]

Latest revision as of 08:51, 15 April 2021

Home * Engines * TSCP

Simplicius Simplicissimus [1]

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].

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 ...

2000 ...

Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000 » SCP Repetition detection
TSCP with bitboards by Russell Reagan, CCC, June 01, 2003

2010 ...

2020 ...

External Links

References

Up one Level