[[File:marklefler.jpg|thumb|right|Mark Lefler]]
...ember of the [[Komodo]] team <ref>[http://www.talkchess.com/forum/viewtopic.php?t=49623&start=23 Who is Don/Larry's new partner!?] by [[Don Dailey]], [[
10 KB (1,343 words) - 15:21, 1 October 2018
...seem to work in his program <ref>[http://www.talkchess.com/forum/viewtopic.php?t=15688 movei hash report] by [[Uri Blass]], [[CCC]], August 09, 2007</r
Movei played the [[WCCC 2004]] in [https://en.wikipedia.org/wiki/Ramat_Gan Ramat Gan], and on-line the [[CCT5]], [[CCT6]] and [[CCT7
8 KB (1,143 words) - 19:56, 6 July 2019
File:Zermelo.jpeg|[[Ernst Zermelo]]<br/>1871 - 1953
File:norbert_wiener_3.jpg|[[Norbert Wiener]]<br/>1894 - 1964
14 KB (1,801 words) - 18:29, 25 February 2021
* [[Futility pruning]]
...Pruning#MoveCountBasedPruning|LMP]] - Late Move Pruning, Move Count Based Pruning
10 KB (1,192 words) - 22:14, 18 November 2020
...x|link=https://github.com/kervinck|Marcel van Kervinck <ref>[https://github.com/kervinck kervinck (Marcel van Kervinck) · GitHub]</ref> ]]
...el van Kervinck''', (March 27, 1972 – May 25, 2020 <ref>[https://www.cuvo.nl/condoleren/marcel-van-kervinck Marcel van Kervinck | Cuvo]</ref>)<br/>
6 KB (788 words) - 23:03, 30 May 2020
...as designed by [http://iamkle.in/ Klein Maetschke], [https://stockfishchess.org/about/ About - Stockfish]</ref> ]]
...as designed by [http://iamkle.in/ Klein Maetschke], [https://stockfishchess.org/about/ About - Stockfish]</ref> ]]
65 KB (8,362 words) - 13:19, 1 March 2024
...wiki/William_Jones_%28philologist%29 Jones'] Caïssa, [https://en.wikipedia.org/wiki/Ca%C3%AFssa Caïssa from Wikipedia]</ref>]]
...s of Controlling the Tree Search in Chess Programs''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol
54 KB (7,939 words) - 06:55, 24 September 2023
...story Exhibits Photo Tour] created January 2000 by [http://infolab.stanford.edu/~gio/ Gio Wiederhold]</ref> ]]
...Kotok-McCarthy-Program was written in [[Fortran]] and [https://en.wikipedia.org/wiki/IBM_704/9/90_FORTRAN_Assembly_Program#FORTRAN_Assembly_Program FAP]
5 KB (654 words) - 14:27, 25 January 2020
...hael|Raphael]]. It is not proven that this is Euclid. [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
<ref>[https://en.wikipedia.org/wiki/List_of_ancient_Egyptian_scribes List of ancient Egyptian scribes -
805 KB (106,796 words) - 11:23, 6 August 2021
...ipedia.org/wiki/Downtown_Edmonton Downtown Edmonton], [https://en.wikipedia.org/wiki/Alberta Alberta], August 14, 2006, Myke Waddy</ref> ]]
...tion Processing Society] (CIPS), and was sponsored by [https://en.wikipedia.org/wiki/Alberta_Government_Telephones Alberta Government Telephones] (AGT)
28 KB (3,459 words) - 11:29, 28 January 2020
...m/en/hotels/new-mexico/doubletree-by-hilton-hotel-albuquerque-ALBSMDT/index.html DoubleTree Albuquerque by the University of New Mexico]</ref> ]]
...edia.org/wiki/Albuquerque%2C_New_Mexico Albuquerque], [https://en.wikipedia.org/wiki/New_Mexico New Mexico], USA.
11 KB (1,377 words) - 11:57, 28 January 2020
...Heritage Trail|The Industrial Heritage Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], Photo by [[Gerd Isenberg]], October 01, 2016</ref>
...://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>. Tech competed at three [[ACM North American Comput
11 KB (1,510 words) - 10:48, 27 September 2020
...nd_Artificial_Intelligence_Laboratory CSAIL] in 2006, [https://en.wikipedia.org/wiki/Alan_Kotok Alan Kotok from Wikipedia]</ref> ]]
...tok-McCarthy-Program]] was written in [[Fortran]] and [https://en.wikipedia.org/wiki/IBM_704/9/90_FORTRAN_Assembly_Program#FORTRAN_Assembly_Program FAP]
5 KB (650 words) - 11:00, 9 July 2019
...810637&dl=GUIDE&coll=GUIDE&CFID=85270894&CFTOKEN=84258946 An adaptive tree pruning system: A language for programming heuristic tree searches]''. Proceedings
...nnis Cooper|Dennis W. Cooper]] ('''1973'''). ''[https://www.semanticscholar.org/paper/COKO-III%3A-The-Cooper-Koz-Chess-Program-Kozdrowicki-Cooper/8ca0c0
12 KB (1,750 words) - 19:03, 18 May 2020
[[FILE:KnightsTemplarPlayingChess1283.jpg|border|right|thumb|
...o_X_of_Castile Alfonso X of Castile], 1283</ref> <ref>[https://en.wikipedia.org/wiki/Chess Chess from Wikipedia]</ref> ]]
8 KB (1,171 words) - 00:17, 7 November 2019
...iki/Witenagemot Anglo-Saxon king with his Witan] <ref>[https://en.wikipedia.org/wiki/Witenagemot Witenagemot from Wikipedia]</ref> ]]
...ce, November 7-10, San Franciso, California]</ref> in [https://en.wikipedia.org/wiki/San_Francisco San Francisco] and had been impressed by [[Richard Gr
10 KB (1,448 words) - 16:04, 16 November 2020
...org/licenses/publicdomain/ Public Domain Dedication], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...r of effort <ref>[http://www.columbia.edu/cu/computinghistory/elliott-frank.html#cccp Recollections of CUCC 1968-70 -The CCCP Chess Program]</ref> .
6 KB (822 words) - 23:06, 1 January 2020
...[https://en.wikipedia.org/wiki/Creative_Commons CC], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...mittman/3-1%20and%203-3.computer_chess_panel.mittman_etc.1971.ACM.062303021.pdf pdf] from [[The Computer History Museum]]</ref> :
7 KB (1,107 words) - 00:17, 7 November 2019
...ki/Benutzer:-donald- A. Kniesel], September 03, 2004, [https://en.wikipedia.org/wiki/Ostrich Ostrich from Wikipedia]</ref> ]]
...tations taking place <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc19ea63 Eight screen terminal of computer chess machine Os
19 KB (2,807 words) - 21:04, 27 December 2019
...ipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Fox Fox from Wikipedia]</ref> ]]
...mputer_Chess_Newsletter/Issue_2_Computer_Chess_Newsletter.1977.062303031.sm.pdf pdf reprint] from [[The Computer History Museum]]</ref>.
5 KB (785 words) - 12:59, 22 October 2019
...rg/wiki/The_Courier-Journal The Courier-Journal] from [https://en.wikipedia.org/wiki/Louisville,_Kentucky Louisville, Kentucky], February 18, 1974, pp.
...rg/wiki/The_Courier-Journal The Courier-Journal] from [https://en.wikipedia.org/wiki/Louisville,_Kentucky Louisville, Kentucky], May 19, 1974, pp. 209,
6 KB (885 words) - 19:52, 3 July 2021
...ons Wikimedia Commons], [http://de.wikipedia.org/wiki/Blitz Blitz wikipedia.de] (German)</ref> ]]
...Slate]]/[[Larry Atkin|Atkin]] and [[Chess (Program)#Chess 4.0 - 4.9|Chess 4.x]]. This version competed in the [[ACM 1978]], the [[ACM 1979]] (ran on [[U
5 KB (807 words) - 16:14, 16 November 2020
...ser]], computerzeitalter <ref>[http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN Schaakkunst Bernd Besser]</ref> ]]
...ophila]''? [http://www.informatik.uni-trier.de/%7Eley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203</ref> . In disagreement with the AI establishment
76 KB (10,439 words) - 14:01, 10 August 2023
[[FILE:DonBeal1986.JPG|border|right|thumb| Don Beal, [[WCCC 1986]] <ref>[[László Lindner]],
...rm-Platform Computer Chess Championship]] <ref>[http://old.csvn.nl/uni_hist.html QMW "Uniform Platform" Computer-Chess Tournament] from the old [[CSVN]]
14 KB (1,937 words) - 17:07, 16 November 2020
...tps://en.wikipedia.org/wiki/Rijksmuseum Rijksmuseum], [https://en.wikipedia.org/wiki/Rembrandt Rembrandt from Wikipedia]</ref> ]]
...s sole authors <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=46 Master's ICGA Tournaments]</ref>.
14 KB (2,124 words) - 17:07, 16 November 2020
.../3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf]</ref> ]]
.../wiki/InfoWorld InfoWorld], November 5, 1984, pp. 18, [https://books.google.de/books?id=oC4EAAAAMBAJ&lpg=PA49&dq=InfoWorld%2C%20November%205%2C%201984&c
17 KB (2,527 words) - 23:40, 18 February 2021
...MyChess II <ref>[http://www.spacious-mind.com/html/commodore_c64_mychess_ii.html Commodore 64/128 Old Computer Chess Game Collection - Mychess II] from
...ritten in [[Assembly|assembly]] language to run under [https://en.wikipedia.org/wiki/CP/M CP/M]. It had its quite successful debut at the [[ACM 1979]] a
8 KB (1,106 words) - 22:22, 16 December 2019
...[https://en.wikipedia.org/wiki/Melbourne Melbourne], [https://en.wikipedia.org/wiki/The_Pioneer_%28painting%29 The Pioneer (painting) from Wikipedia]</
...public under tournament conditions <ref>[https://www.stmintz.com/ccc/index.php?id=211423 Re: KAISSA for PC, I'm the proud owner] by [[Eugene Nalimov]],
38 KB (4,367 words) - 09:31, 28 March 2021
#include <stdio.h>
#include <stdlib.h>
6 KB (673 words) - 10:57, 22 September 2018
...he_Stone_%28film%29 The Sword in the Stone], the 1963 [https://en.wikipedia.org/wiki/Walt_Disney Disney] film, was eponym of the programs name</ref> ]]
...984]] in [https://en.wikipedia.org/wiki/Baarn Baarn], [https://en.wikipedia.org/wiki/Netherlands The Netherlands] <ref>[[Jaap van Oosterwijk Bruyn]] (''
7 KB (998 words) - 10:24, 31 March 2021
'''[[Main Page|Home]] * [[Engines]] * Chess 0.5'''
...e-1978-10 Byte Vol. 3, No. 10, October 1978] from the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive]</ref> ]]
20 KB (2,535 words) - 23:06, 27 September 2020
....org/wiki/Friedrich_Justin_Bertuch F.J. Bertuch] <ref>[https://en.wikipedia.org/wiki/Phoenix_%28mythology%29 Phoenix (mythology) from Wikipedia]</ref> ]
...gy]] <ref>[[Jonathan Schaeffer]] ('''1997, 2009'''). ''[http://www.springer.com/computer/ai/book/978-0-387-76575-4 One Jump Ahead]''. 1. This Was Going
12 KB (1,783 words) - 17:57, 26 December 2019
...3]] in [https://en.wikipedia.org/wiki/Leiden Leiden], [https://en.wikipedia.org/wiki/Netherlands The Netherlands].
<ref>[http://www.csvn.nl/index.php/historie/n-k-computerschaak/38-1993 ONK 1993] [[CSVN]] site</ref>
18 KB (2,062 words) - 12:05, 28 January 2020
.../fischer-vs-tal-leipzig-ol-1960 Fischer vs Tal (Leipzig ol 1960)] - [[Chess.com]]</ref>]]
.../3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf reprint] from [[The Computer History Museum]]</ref> . In 1993, Bobby
12 KB (1,653 words) - 18:37, 25 February 2021
...tch Rebel], [[Cartoons#Cartoons|Rebel Cartoon]] by [http://www.diazcartoons.nl/ José Diaz]</ref> ]]
...t Generation in March 2014, turned out to be an early [https://en.wikipedia.org/wiki/April_Fools%27_Day April fool], a [[Stockfish]] version was running
22 KB (3,106 words) - 17:47, 11 August 2023
...www.flickr.com/people/39373836@N06 Marjolein Benard], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...LittleThought is able to play [[Chess960]] <ref>[http://www.kimiensoftware.com/software/chess/littlethought_history Kimien Software - LittleThought Che
6 KB (723 words) - 14:10, 29 July 2019
...s://en.wikipedia.org/wiki/Willem_Blaeu Willem Blaeu], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
...91]] with 2½ out of 7, as well the [[WMCCC 1990]] in [https://en.wikipedia.org/wiki/Lyon Lyon] and the [[IPCCC 1991]].
4 KB (548 words) - 10:43, 2 April 2020
...François Boucher]] - Jupiter and Callisto, 1744 [https://commons.wikimedia.org/wiki/Fran%C3%A7ois_Boucher François Boucher - Wikimedia Commons]</ref>
...rcial programs using [[Recursion|recursive]] [[Null Move Pruning|null move pruning]] already in the 80s.
5 KB (653 words) - 13:24, 17 March 2020
...pedia.org/wiki/Quest Quest from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/The_Bold_Knight,_the_Apples_of_Youth,_and_the_Water_of_Life The Bol
...aft 2001 Leiden - Zweiter Teil] by [[Eric van Reem]], [[ChessBase|ChessBase.de Events]] (German) (Quest)</ref> .
6 KB (946 words) - 18:05, 26 December 2019
...ipedia.org/wiki/Tuna_Technologies Phoenix Games] <ref>[http://www.mobygames.com/game/windows/chess-champ Chess Champ for Windows (2003) - MobyGames]</re
...[[ICGA]] page <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=193 LChess' ICGA Tournaments]</ref>:
4 KB (562 words) - 13:51, 10 July 2020
...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
...a.org/wiki/User:Stannered Stannered], March 30, 2007, [https://en.wikipedia.org/wiki/Sex Sex from Wikipedia]</ref> ]]
...es 0..7), [[Depth|depth]], [[Killer Heuristic|Killer heuristic]], [[Parity Pruning]], two separate SEX-values for both sides, [[Checkmate|Mate threats]] and [
11 KB (1,590 words) - 23:56, 27 December 2018
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * Pruning'''
...8bab#57f3b7277d58ae2139bf8baf Return to Vilna Series], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</
16 KB (2,174 words) - 11:35, 16 June 2021
...n Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Mate Distance Pruning'''
...l not add much to a programs [[Playing Strength|playing strength]] as this pruning only comes into effect when a position is already decided, still it helps w
5 KB (719 words) - 11:57, 12 May 2018
...[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Null Move Pruning'''
...3b6d77d58ae5574bf8bc5 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</
40 KB (5,641 words) - 18:55, 25 December 2020
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Multi-Cut'''
...gory:Katsushika_Hokusai Category:Katsushika Hokusai], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
7 KB (1,046 words) - 13:55, 28 December 2019
...age|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Enhanced Forward Pruning'''
...<ref>[http://lemondedekitchi.blogspot.de/2014/10/great-women-1-hannah-hoch.html le monde de kitchi: Great Women #1: Hannah Höch] (German)</ref> ]]
7 KB (953 words) - 23:30, 2 November 2019
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * ProbCut'''
...C Research Institute, Princeton, N.J. [http://skatgame.net/mburo/ps/improve.pdf pdf], 8 Multi-ProbCut, pp 7.</ref> ]]
17 KB (2,330 words) - 12:12, 2 May 2020
...age|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Reverse Futility Pruning'''
'''Reverse Futility Pruning''', (RFP, Static Null Move Pruning)<br/>
4 KB (475 words) - 18:20, 29 April 2018
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Uncertainty Cut-Offs'''
[[FILE:Uncertainty principle.gif|border|right|thumb|
7 KB (968 words) - 23:21, 14 December 2019
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Futility Pruning'''
...Back in Holland 1941 - 1954"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
15 KB (2,022 words) - 09:48, 8 July 2021
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * AEL-Pruning'''
'''AEL-pruning''',<br/>
4 KB (534 words) - 18:47, 29 April 2018
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Delta Pruning'''
'''Delta Pruning''',<br/>
3 KB (418 words) - 10:37, 25 September 2020
...in Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * History Leaf Pruning'''
'''History leaf pruning''',<br/>
1 KB (164 words) - 18:59, 29 April 2018
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Parity Pruning'''
'''Parity Pruning''', <br/>
1 KB (142 words) - 22:16, 31 May 2018
'''Reductions''' (as opposed to [[Pruning|pruning]]),<br/>
=Pruning after a reduced Search=
5 KB (644 words) - 09:49, 8 July 2021
...3b6d77d58ae5574bf8bc8 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [[University of Minnesota]]</
...duction to Late Move Reductions] by [[Tord Romstad]] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])</ref> used open source implementa
17 KB (2,291 words) - 11:20, 4 April 2022
...based on the [[Null Move Observation]] (NMO) - similar to the [[Null Move Pruning|Null Move Heuristic]] (NMH). The idea is to search to shallower [[Depth|dep
* [[Null Move Pruning]]
3 KB (478 words) - 16:09, 16 May 2018
...ain Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * [[Null Move Pruning]] * Double Null Move'''
...d for [[Pawn Endgame|pawn endings]] <ref>[https://www.stmintz.com/ccc/index.php?id=123223 Re: double nullmove??] by [[Vincent Diepeveen]], [[CCC]], Augu
4 KB (507 words) - 20:31, 29 April 2018
...[Nathan S. Netanyahu]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_19 Extended Null-Move Reductions]''. [[CG 2008]]</ref
If a null move [[Fail-High|fail-high]] occurs - opposed to Null Move Pruning - the search is reduced by '''four''' plies, rather than pruned. Thus, '''N
2 KB (310 words) - 15:19, 27 August 2018
* [[Null Move Pruning]]
* [[Reverse Futility Pruning]]
3 KB (339 words) - 17:17, 4 September 2018
...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
