...ject.jpg At the Roulette Table in Monte Carlo, 1893], [https://en.wikipedia.org/wiki/Edvard_Munch Edvard Munch from Wikipedia]</ref> ]]
...z]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf]</ref>.
76 KB (10,188 words) - 16:36, 1 December 2021
...er]], Auf der Suche <ref>[http://schachbilderwelten.tenners.de/html/galerie.html Schach Bilder Welten - Bernd Besser - Galerie]</ref> ]]
...ata_structure%29 tree-like data-structure] by various [https://en.wikipedia.org/wiki/Search_algorithm search algorithms].
34 KB (4,570 words) - 22:36, 17 May 2023
...s.com/alphabeta.htm|Alpha Beta <ref>[http://vangelismovements.com/alphabeta.htm Alpha Beta - Astral Abuse] a look at the music of [[:Category:Vangelis|V
...s''. [https://researcher.ibm.com/researcher/files/us-beygel/samuel-checkers.pdf pdf], IBM Journal - November 1967,
37 KB (5,099 words) - 16:20, 1 December 2021
...arijs vtilissimis Georgij Trapezunt]''. pp. 119, from [https://de.wikipedia.org/wiki/Johannes_a_Lasco_Bibliothek Johannes a Lasco Bibliothek] (JALB)</re
'''Node''', ([https://en.wikipedia.org/wiki/Vertex_%28graph_theory%29 vertex])<br/>
6 KB (890 words) - 22:16, 8 July 2020
...lpha-Beta Pruning] from the [http://www.netlib.org/utk/lsi/pcwLSI/text/BOOK.html Parallel Computing Works] ebook</ref> ]]
...No. 4, pp. 442-452. [http://webdocs.cs.ualberta.ca/~tony/OldPapers/parallel.pdf 1984 pdf] (Draft)</ref>.
15 KB (2,159 words) - 11:21, 31 May 2021
...Numbers <ref>Image by TNSENesamaniTpr, July 06, 2017, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...eta Heuristic''. AIM-030, available from [http://dspace.mit.edu/handle/1721.1/6098 DSpace] at [[Massachusetts Institute of Technology|MIT]]</ref> .
6 KB (897 words) - 19:33, 2 February 2019
...Laurentius de Voltolina, second half of 14th century, [https://en.wikipedia.org/wiki/Learning Learning from Wikipedia]</ref> ]]
...[http://www.beatthegmat.com/inductive-learning-vs-deductive-learning-t36273.html Inductive learning vs Deductive learning]</ref>.
137 KB (18,484 words) - 00:18, 19 December 2021
...[[IBM 704]] console <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431614f6482e6 IBM programmer Alex Bernstein] 1958 Courtesy of [[
...hink|Machines Who Think]]'' <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70939&start=17 Re: The mystery of Alex Bernstein] by [[Sergei Mark
11 KB (1,607 words) - 18:38, 25 February 2021
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...
: [http://groups.google.com/group/rec.games.chess.computer/msg/0df39371422a600c Re: computer chess "oracle" ideas...] by [[Ron
5 KB (631 words) - 21:04, 8 November 2021
...ikipedia.org/wiki/John_Cage John Cage from Wikipedia] [https://en.wikipedia.org/wiki/Fair_use Fair use]</ref> ]]
...|principal variation]] - a sequence of moves acceptable for both players (i.e. not causing a [[Beta-Cutoff|beta-cutoff]] anywhere in the path) which is
28 KB (3,999 words) - 00:15, 1 February 2022
...:The_Persistence_of_Memory.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/The_Persistence_of_Memory|
[[:Category:Salvador Dalí|Salvador Dalí]], [https://en.wikipedia.org/wiki/The_Persistence_of_Memory The Persistence of Memory] 1931 ]]
60 KB (8,162 words) - 21:35, 28 April 2022
...e deepening search <ref>[http://ray.sakura.ne.jp/search_problem/i_deepening.html Iterative deepening （反復深化法）]</ref> ]]
...f]]'', slides as [http://www.iis.sinica.edu.tw/~tshsu/tcg2010/slides/slide3.pdf pdf]</ref> :
13 KB (1,843 words) - 23:44, 4 October 2019
...ology] Reviewed by [http://www.chicagoartcriticsassociation.org/B/poplawska.html Anna Poplawska]</ref> ]]
...xchange Evaluation|static exchange evaluation]] < 0, [[Delta Pruning|delta pruning]] can be used for that purpose.
25 KB (3,459 words) - 10:30, 15 June 2021
=[[Pruning]]=
* [[AEL-Pruning]]
9 KB (1,219 words) - 21:02, 25 June 2020
....archive.org/web/20070607231311/www.brucemo.com/compchess/programming/index.htm Programming Topics]</ref> :
* [[Pruning]]
14 KB (1,884 words) - 21:12, 20 November 2020
...g#ThreatDetection|threat move detection]] in [[Null Move Pruning|null move pruning]]. If the [[Threat Move|threat move]] is the same on two consecutive plies
* [[Null Move Pruning#ThreatDetection|Threat Detection]]
2 KB (270 words) - 22:06, 27 April 2018
...]], September 04, 2010</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54281 search extensions] by [[Robert Hyatt]], [[CCC]], November 08, 20
...so a form of check extension <ref>[http://www.talkchess.com/forum/viewtopic.php?t=23447 checks in q-search] by [[Robert Hyatt]], [[CCC]], September 02,
5 KB (739 words) - 23:34, 29 July 2019
...Some programs detect [[Mate at a Glance|mate in one threats]] statically, i.e. as part or byproduct of [[King Safety|king safety]] in [[Evaluation|evalu
...cores to detect threats before 1990 <ref>[https://www.stmintz.com/ccc/index.php?id=14327 Re: Deep Search Extension] by [[Ernst A. Heinz]], [[CCC]], Janu
6 KB (836 words) - 22:12, 27 April 2018
...3b6d67d58ae5574bf8baa Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</
...e, Vol. 252, pp. 177-196. [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01a.pdf pdf]</ref> , to prune if in a reduced search multiple moves may [[Fail-H
16 KB (2,280 words) - 17:09, 16 November 2020
...Wired News] Interview with Murray Campbell by [http://www.robertandrews.co.uk/ Robert Andrews], May 11, 2007</ref> ]]
...tson_Research_Center T. J. Watson Research Center] in [https://en.wikipedia.org/wiki/Yorktown_Heights,_New_York Yorktown Heights, New York].
13 KB (1,716 words) - 17:09, 16 November 2020
