...ikipedia.org/wiki/Occam%27s_razor Occam's razor] <ref>[https://en.wikipedia.org/wiki/William_of_Ockham William of Ockham] – Sketch labeled "frater Occ
...ere are various implementations of Razoring, somehow diminishing [[Pruning|pruning]] and [[Reductions|reductions]] near the [[Horizon Node|horizon]]. Razoring
14 KB (1,941 words) - 20:31, 6 November 2020
...ha, if no [[Tactical moves|tactical move]] is available, or due to [[Delta Pruning]] good enough to raise alpha, those [[Leaf Node|leaves]] return alpha ([[Fa
[[FILE:Hoheward-Panorama.jpg|none|border|text-bottom|1024px]]
5 KB (765 words) - 19:57, 6 August 2018
...CCC]], September 13, 2004</ref>, this is where [[Futility Pruning|futility pruning]] might be applied.
* [https://en.wikipedia.org/wiki/Frontier_%28disambiguation%29 Frontier (disambiguation) from Wikipe
1,000 bytes (138 words) - 21:04, 29 April 2018
...n Chess''. Masters thesis, [http://homepages.cwi.nl/%7Epaulk/theses/Carolus.pdf pdf]</ref>, rely on the assumption that the positions from the sibling n
* [https://en.wikipedia.org/wiki/Sibling Sibling from Wikipedia]
745 bytes (110 words) - 17:24, 26 September 2018
...frontier nodes as depth == 1 nodes <ref>[https://www.stmintz.com/ccc/index.php?id=387518 Re: simple node definitions question] by [[Robert Hyatt]], [[C
889 bytes (128 words) - 21:07, 29 April 2018
...ha, if no [[Tactical Moves|tactical move]] is available, or due to [[Delta Pruning]] good enough to raise alpha, those [[Leaf Node|leaves]] return alpha ([[Fa
* [https://www.stmintz.com/ccc/index.php?id=280447 quiescent nodes, and history heuristic...] by [[Joel Veness]],
2 KB (341 words) - 15:25, 9 April 2020
...on (game tree), PV of a [[Minimax]] tree in blue <ref>[https://en.wikipedia.org/wiki/Variation_%28game_tree%29 Variation (game tree) from Wikipedia]</re
...]], September 11, 2004</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?t=29730 Extracting PV from TT] by Colin, [[CCC]], September 12, 2009</re
16 KB (2,278 words) - 16:45, 3 November 2020
...e.wikipedia.org/wiki/Mars-Scout-Programm Mars-Scout-Programm from Wikipedia.de]</ref> ]]
...ka-Jones]], [[Rajjan Shinghal]] ('''1985'''). ''An empirical comparison of pruning strategies in game trees''. [[IEEE#SMC|IEEE Transactions on Systems, Man, a
6 KB (832 words) - 15:09, 22 November 2018
...-5000.nl/ps/An%20improvement%20to%20the%20scout%20tree%20search%20algorithm.pdf|pdf]]</ref>. The improvements rely on a [[Negamax]] framework and some [
.../web.archive.org/web/20040403211728/brucemo.com/compchess/programming/index.htm Programming Topics]</ref>.
12 KB (1,752 words) - 20:59, 2 March 2020
...ts_MET_sf1991.402.9.jpg?uselang=en Four Parts], 1932, [https://en.wikipedia.org/wiki/Metropolitan_Museum_of_Art Metropolitan Museum of Art]</ref> ]]
...'. [[CG 2004]], [http://www.personeel.unimaas.nl/m-winands/documents/relhis.pdf pdf]</ref>
31 KB (4,202 words) - 18:27, 12 March 2022
...)_MET_DP855300.jpg?uselang=en Small Worlds IX], 1922, [https://en.wikipedia.org/wiki/Metropolitan_Museum_of_Art Metropolitan Museum of Art]</ref> ]]
...ecks]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=40100 Reducing/Pruning Bad Captures (SEE < 0)] by [[Edsel Apostol]], [[CCC]], August 19, 2011</ref
20 KB (2,822 words) - 10:43, 1 August 2022
...wiki/Jack_the_Ripper Jack the Ripper from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...''). ''A Program to Play Chess End Games''. Technical Report no. CS-106, Ph.D. thesis. [[Stanford University]], Computer Science Department <ref>[[Jos U
11 KB (1,583 words) - 09:01, 20 July 2021
...s], [https://en.wikipedia.org/wiki/Lille Lille], [https://commons.wikimedia.org/wiki/Category:Alfred_Agache Category:Alfred Agache - Wikimedia Commons]<
...in Rebel] by [[Ed Schroder|Ed Schröder]], also available as [https://silo.tips/download/how-rebel-plays-chess-1 pdf]</ref> . In the literature, histor
12 KB (1,686 words) - 21:40, 11 February 2021
* [[History Leaf Pruning]]
...tility Pruning#MoveCountBasedPruning|Move Count Based Pruning]] (Late Move Pruning)
915 bytes (115 words) - 10:27, 30 April 2018
...m Picture gallery "Symmetry"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
...>[http://www.talkchess.com/forum/viewtopic.php?t=47953&start=2 Re: History pruning / move ordering question] by [[Don Dailey]], [[CCC]], May 10, 2013</ref>.
13 KB (1,736 words) - 16:05, 12 January 2019
...Heuristic]''. [[CG 2004]], [http://erikvanderwerf.tengen.nl/pubdown/relhis.pdf pdf]
...he [[CG 2004|Computers and Games Conference 2004]] in [https://en.wikipedia.org/wiki/Ramat_Gan Ramat Gan] as improvement of the [[History Heuristic]].
6 KB (851 words) - 17:48, 19 December 2018
...ipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Metropolitan_Museum_of_Art Metropolitan Museum of Art]</ref>]]
counterMove[previousMove.from][previousMove.to] = move;
5 KB (732 words) - 10:47, 16 February 2022
...dia.org/wiki/Point_guard Point guard from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...ess]''. Ph.D. thesis, [[Carnegie Mellon University]], [https://en.wikipedia.org/wiki/MIT_Press MIT Press]</ref> , utilizing the [[Point Value|value]] of
6 KB (841 words) - 21:25, 29 June 2018
...n.wikipedia.org/wiki/Cut-off Cut-off from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...[[Recursion|recursive]] call <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=394125&t=38007 Re: What the computer chess communit
4 KB (515 words) - 10:27, 7 April 2022
...ipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Kunstmuseum_Basel Kunstmuseum Basel]</ref>]]
...chess move-ordering schemes using move influence]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol
11 KB (1,358 words) - 23:25, 5 February 2020
