Difference between revisions of "Tom King"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 38: | Line 38: | ||
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69481 Simplest way to implement quick and dirty lazy smp] by [[Tom King]], [[CCC]], January 04, 2019 » [[Lazy SMP]] | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69481 Simplest way to implement quick and dirty lazy smp] by [[Tom King]], [[CCC]], January 04, 2019 » [[Lazy SMP]] | ||
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69722 Null move pruning, only when score >= beta?] by [[Tom King]], [[CCC]], January 25, 2019 » [[Null Move Pruning]] | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69722 Null move pruning, only when score >= beta?] by [[Tom King]], [[CCC]], January 25, 2019 » [[Null Move Pruning]] | ||
| + | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70217 Depth reduced but ELO increased] by [[Tom King]], [[CCC]], March 16, 2019 » [[Countermove Heuristic]], [[Playing Strength]] | ||
=External Links= | =External Links= | ||
Revision as of 10:52, 3 May 2019
Tom King [1]
Tom King,
a British computer scientist in the information security management [2], and computer games programmer [3].
Tom is author of the Chess Engine Communication Protocol compatible [4] chess engine Francesca [5].
Contents
Publications
- Tom King (2000). Shredder wins the 17th World Microcomputer Chess Championship. ICGA Journal, Vol. 23, No. 3 » Shredder, WMCCC 2000
Forum Posts
1997 ...
- Null move depth reductions by Tom King, rgcc, February 02, 1997 » R, Null Move Pruning
- 32bits - enough for hashing board? by Tom King, rgcc, January 13, 1998 » Zobrist Hashing
- Null move around (beta-1, beta) by Tom King, rgcc, March 05, 1999 » Null Move Pruning
- Asymetric king safety by Tom King, rgcc, March 13, 1999 » Asymmetric Evaluation, King Safety
- SEE for forward pruning in Q. Search by Tom King, CCC, August 04, 1999 » SEE, Quiescence Search
- SEE for forward pruning in the Q. search - I'm confused! by Tom King, CCC, August 11, 1999
- Test suites - can they reliably predict ELO? by Tom King, CCC, December 11, 1999 » Test-Positions
2000 ...
- Fail highs..which subsequently fail low by Tom King, CCC, August 27, 2000 » Fail-High, Fail-Low, Search Instability
- Move ordering at root of search by Tom King, CCC, May 07, 2001 » Move Ordering
- Null move R=2 vs Null move R=2/3 by Tom King, CCC, August 09, 2001 » R, Null Move Pruning
- Value of playing different versions of a program against each other by Tom King, CCC, January 06, 2003 » Engine Testing
2005 ...
- history pruning/ late move pruning by Tom King, Winboard Forum, March 02, 2006 » Late Move Reductions
- Francesca MAD v0.11 Released by Tom King, CCC, March 06, 2006
- Verified null-move pruning by Tom King, Winboard Forum, March 09, 2006 » Verified Null-Move Pruning
2010 ...
- static null move pruning in stockfish by Tom King, CCC, June 13, 2010 » Null Move Pruning, Stockfish
- move count based pruning by Tom King, CCC, September 02, 2010 » Late Move Reductions
- Most important eval elements by Tom King, CCC, September 17, 2010 » Evaluation
- Using SEE to prune in main search by Tom King, CCC, January 08, 2011 » SEE
- value of king tropism in eval function by Tom King, CCC, May 17, 2011 » King Safety
2015 ...
- After an 8 year break.. by Tom King, CCC, December 30, 2018
- Simplest way to implement quick and dirty lazy smp by Tom King, CCC, January 04, 2019 » Lazy SMP
- Null move pruning, only when score >= beta? by Tom King, CCC, January 25, 2019 » Null Move Pruning
- Depth reduced but ELO increased by Tom King, CCC, March 16, 2019 » Countermove Heuristic, Playing Strength
