...van-den-herik#tab-1|Jaap van den Herik <ref>[https://www.universiteitleiden.nl/en/staffmembers/jaap-van-den-herik#tab-1 Jaap van den Herik - Leiden Univ
...fessorial chair from Leiden University <ref>[https://www.universiteitleiden.nl/en/staffmembers/jaap-van-den-herik#tab-1 Jaap van den Herik - Leiden Univ
62 KB (8,279 words) - 13:30, 17 November 2021
...ki/Brute_Force_%281947_film%29|Brute Force, 1947 <ref>[https://en.wikipedia.org/wiki/Brute_Force_%281947_film%29 Brute Force (1947 film) from Wikipedia]
...es for the solution to prove whether it satisfies the [https://en.wikipedia.org/wiki/Problem_statement problem statement]. Brute-force algorithms are co
8 KB (1,101 words) - 14:03, 24 November 2018
...ion and Success 1955 - 1972"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref>
...performed in forward pruning techniques like [[Null Move Pruning|null move pruning]] and [[Multi-Cut|multi-cut]].
28 KB (3,741 words) - 10:51, 16 February 2022
...Yngvi Björnsson]], [[Tony Marsland]] ('''2001'''). ''Multi-cut Alpha-Beta Pruning in Game Tree Search.'' Theoretical Computer Science, Vol. 252</ref>. In man
...epth with greater reductions <ref>[http://www.talkchess.com/forum/viewtopic.php?t=64927 Rethinking r in null move] by [[Michael Sherwin]], [[CCC]], Augu
3 KB (420 words) - 15:24, 27 August 2018
...tps://en.wikipedia.org/wiki/Jones_stain Jones stain], [https://en.wikipedia.org/wiki/Pathology Pathology from Wikipedia]</ref> ]]
...ion of independence of sibling values of trees with low branching factor (i.e. binary trees) with game theoretic leaf values of win and loss {1, -1}. In
12 KB (1,680 words) - 11:13, 4 April 2021
...Back in Holland 1941 - 1954"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
...the current [[Search Tree|search tree]] to make it a [https://en.wikipedia.org/wiki/Directed_acyclic_graph directed acyclic graph] (DAG), but allow a o
34 KB (4,898 words) - 12:51, 21 August 2022
...ve|side to move]] relative [[Negamax|negamax]] metric always the minimum, i.e. VALUE_MATED = -[[Word#Ranges|SHRT_MAX]]/2. Below the root the absolute va
Inside a negamax based search, most <ref>[https://www.stmintz.com/ccc/index.php?id=469728 The Code for the Rybka-Mate-Bug] by [[Chrilly Donninger]], [[C
22 KB (3,042 words) - 10:31, 11 April 2021
...Back in Holland 1941 - 1954"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
...'''). ''A Minimax Algorithm Better than Alpha-Beta?'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol
18 KB (2,480 words) - 23:49, 9 March 2019
* [https://groups.google.com/d/msg/rec.games.chess.computer/xkepvuKHYUc/vI9AK1G2KkwJ bounds in alpha-beta] by [[Walter Ravenek]
...nds?] by [[Steve Maughan]], [[CCC]], December 14, 2000 » [[Fail-Soft]], [[Pruning]]
2 KB (240 words) - 23:18, 1 August 2020
...told him that he had read the SIGART paper, and had sped up [[Belle]] by 1.5x with null windows <ref>[[John Philip Fishburn]], personal communication</
* [[Null Move Pruning]] to prove a null move [[Fail-High|fails high]]
3 KB (443 words) - 16:23, 2 May 2018
...Century 21 and move on)] by Dominic01, May 19, 2013, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...on with [[Transposition Table|transposition tables]] and various [[Pruning|pruning]]-, [[Reductions|reduction]]- and [[Extensions|extension]] techniques.
8 KB (1,151 words) - 20:49, 12 March 2022
* [https://www.stmintz.com/ccc/index.php?id=136488 Fail-soft or Fail-hard ?] by [[Teerapong Tovirat]], [[CCC]], N
* [https://www.stmintz.com/ccc/index.php?id=363710 Fail-hard, fail-soft question] by [[Dan Honeycutt]], [[CCC]],
2 KB (245 words) - 00:11, 1 February 2022
...r Camden Fort Meagher] by Twhelton, February 9, 2013, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
.../web.archive.org/web/20040403211728/brucemo.com/compchess/programming/index.htm Programming Topics Site]</ref>:
6 KB (812 words) - 20:53, 8 April 2020
...stability Rayleigh–Taylor instability from Wikipedia], [http://hubblesite.org/newscenter/archive/releases/2005/37/image/a/ HubbleSite - NewsCenter - A
...like [[Null Move Pruning|null move pruning]], [[Futility Pruning|futility pruning]], and [[History Heuristic|history heuristic]] to decide about [[Late Move
7 KB (952 words) - 13:56, 7 December 2019
....org/wiki/User:Cburnett Cburnett], December 30, 2006, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...'''average branching factor''' can be calculated <ref>[https://en.wikipedia.org/wiki/Branching_factor Branching factor from Wikipedia]</ref>.
9 KB (1,311 words) - 18:22, 12 March 2021
...r Frank-Walter Steinmeier – Wikipedia.de] (German), [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...oard]] techniques in Java <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=49948 Java & Magic Bitboards] by [[Laurens Winkelhagen]], [[Comput
11 KB (1,545 words) - 20:14, 28 September 2019
...|Irving Amen]], Chess Move, 1977 <ref>[http://www.irvingamen.com/lithograph.htm Lithographs by Irving Amen]</ref> ]]
...move) implies a [[Pieces|piece]] movement of both sides, white and black, e.g. 1. d4 Nf6. To relax this ambiguity, the term Half-move is used, also dona
4 KB (522 words) - 01:58, 17 September 2021
* [[Null Move Pruning]]
* [[Null Move Pruning#ThreatDetection|Threat Detection]]
1 KB (165 words) - 23:05, 12 March 2019
* [[Threat Move]] from [[Null Move Pruning|null move]] refutations
* [http://www.talkchess.com/forum/viewtopic.php?t=61401 Best move statistics] by [[Matthew Lai]], [[CCC]], September 12,
2 KB (387 words) - 09:48, 8 May 2018
...[[Anthony Cozzie]] ('''2005'''). ''[http://www.cis.uab.edu/hyatt/collisions.html The Effect of Hash Signature Collisions in a Chess Program]''. [[ICGA J
* [[Threat Move]] from [[Null Move Pruning|null move]] refutations
3 KB (359 words) - 09:17, 4 July 2021
