Difference between revisions of "TSCP"

From Chessprogramming wiki
Jump to: navigation, search
 
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=

Latest revision as of 09: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

  1. ↑ 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
  2. ↑ TSCP - from Tom Kerrigan's Home Page
  3. ↑ Henk Mannen, Marco Wiering (2004). Learning to play chess using TD(λ)-learning with database games. Cognitive Artificial Intelligence, Utrecht University, Benelearn’04, pdf
  4. ↑ 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
  5. ↑ TSCP - data.c
  6. ↑ TSCP - board.c
  7. ↑ TSCP - search.c
  8. ↑ detects false repetitions in case of exchanging two unequal pieces, also used in Belzebub, credited to SCP and GNU Chess by John Stanback
  9. ↑ Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000
  10. ↑ Re: Move Tables - explain as if I'm five by Karlo Bala Jr., CCC, November 05, 2012
  11. ↑ TSCP - eval.c
  12. ↑ TSCP - from Tom Kerrigan's Home Page Hall of shame

Up one Level

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