...|Adam's]] [http://adamsccpages.blogspot.de/ Computer Chess Pages], May 30, 2012
21 KB (2,855 words) - 15:20, 23 December 2020
...Adam's]] [http://adamsccpages.blogspot.de/ Computer Chess Pages], June 18, 2012
11 KB (1,565 words) - 15:01, 16 August 2018
...unction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012</ref>.
...unction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012 <ref>Martin Meuer, son of [https://en.wikipedia.org/wiki/Hans_Meuer Hans Me
38 KB (4,367 words) - 09:31, 28 March 2021
* [[Rémi Coulom]] ('''2012'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-31866-5_13 CLO
'''2012'''
6 KB (884 words) - 23:12, 21 January 2020
* [https://youtu.be/kVJQkmYU2VA NIPS 2012 Tutoral - Stochastic Search and Optimization], [[James C. Spall#Video|Video
18 KB (2,427 words) - 16:42, 2 June 2021
* [[Alan J. Lockett]] ('''2012'''). ''General-Purpose Optimization Through Information Maximization''. Ph.
30 KB (4,044 words) - 13:16, 18 September 2020
...cal guru (Chess05 Frey/Atkin)] by [[Steven Edwards]], [[CCC]], January 09, 2012</ref> .
...Pascal guru (Chess05 Frey/Atkin)] by [[Jim Ablett]], [[CCC]], January 09, 2012
20 KB (2,535 words) - 23:06, 27 September 2020
| [[ICT 2012]]
...lang=en Similarity test for tournament participation], [[CSVN]], March 12, 2012
2 KB (269 words) - 08:29, 30 June 2018
...aments and Matches|Tournaments]] * [[International CSVN Tournament]] * ICT 2012'''
...: Rybka vs Critter] by Ray, [[Computer Chess Forums|Rybka Forum]], May 13, 2012</ref>.
4 KB (511 words) - 12:10, 28 January 2020
'''[[ICT 2012|< Prev]] [[PT 45|Next >]]'''
6 KB (826 words) - 12:10, 28 January 2020
...pages.blogspot.com/ Adam's Computer Chess Pages] by [[Adam Hair]], June 1, 2012
6 KB (853 words) - 23:15, 16 December 2019
...Schröder about Nona] by [[Ed Schroder|Ed Schröder]], [[CCC]], April 03, 2012</ref> , and Ed, not competing with [[Rebel]] this year, was even mentioned
...tion for Ed Schröder about Nona] by [[Gerd Isenberg]], [[CCC]], April 03, 2012
12 KB (1,798 words) - 17:16, 16 December 2019
...rom ACCA WCRCC 2012] by [[Joost Buijs]], [[CCC]], July 15, 2012 » [[WCRCC 2012]]
6 KB (786 words) - 11:10, 6 March 2020
...y Stardust], [https://en.wikipedia.org/wiki/BBC BBC] Documentary, June 22, 2012, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
3 KB (496 words) - 00:17, 27 December 2019
...5 Re: Depth vs playing strength] by [[John Merlino]], [[CCC]], January 10, 2012 » [[Search with Random Leaf Values]]
9 KB (1,287 words) - 14:44, 29 November 2020
...annes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf]</ref>.
...020'''). ''Minimax Strikes Back''. [https://arxiv.org/abs/2012.10700 arXiv:2012.10700]</ref>.
76 KB (10,188 words) - 16:36, 1 December 2021
...de Man|syzygy]], [[Computer Chess Forums|OpenChess Forum]], September 22, 2012</ref>
...'). ''An Overview of Search Techniques in Multi-Player Games''. [[ECAI CGW 2012]]
34 KB (4,570 words) - 22:36, 17 May 2023
...020'''). ''Minimax Strikes Back''. [https://arxiv.org/abs/2012.10700 arXiv:2012.10700] » [[Reinforcement Learning]]
...e and value returned by minimax search] by [[Chao Ma]], [[CCC]], March 09, 2012 » [[Evaluation]]
17 KB (2,338 words) - 17:34, 15 January 2022
...''). ''Alpha-Beta Pruning for Games with Simultaneous Moves''. [[AAAI|AAAI 2012]]
37 KB (5,099 words) - 16:20, 1 December 2021
...a cut-node became an all-node?] by [[Alcides Schulz]], [[CCC]], March 27, 2012
15 KB (2,159 words) - 11:21, 31 May 2021
'''2012'''
* [[Marco Wiering]], [http://martijnvanotterlo.nl/ Martijn Van Otterlo] ('''2012'''). ''Reinforcement learning: State-of-the-art''. [http://link.springer.co
137 KB (18,484 words) - 00:18, 19 December 2021
...to print tree non-recursively] by [[Daniel Shawul]], [[CCC]], February 24, 2012 » [[Recursion]], [[Iteration]]
...arch tree] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], September 22, 2012
10 KB (1,484 words) - 14:40, 6 April 2021
...=42224 A few general questions...] by [[Bill Henry]], [[CCC]], January 29, 2012 » [[Exact Score]], [[Aspiration Windows]]
5 KB (631 words) - 21:04, 8 November 2021
...rch and Transposition Table] by [[Cheney Nattress]], [[CCC]], December 20, 2012
28 KB (3,999 words) - 00:15, 1 February 2022
...sure frequency of hash collisions] by [[Daniel Shawul]], [[CCC]], June 16, 2012</ref> . When storing only a partial key, the chance of a collision greatly
'''2012'''
60 KB (8,162 words) - 21:35, 28 April 2022
...=42224 A few general questions...] by [[Bill Henry]], [[CCC]], January 29, 2012 » [[Root]], [[Exact Score]]
...ration window for stockfish question] by [[Uri Blass]], [[CCC]], March 12, 2012 » [[Stockfish]]
9 KB (1,262 words) - 00:12, 1 February 2022
'''2012'''
...opic.php?t=42971 checks in quies] by [[Larry Kaufman]], [[CCC]], March 22, 2012
25 KB (3,459 words) - 10:30, 15 June 2021
...nction of number of legal moves] by [[Pio Korinth]], [[CCC]], February 28, 2012 » [[Depth]]
...sic selective search] by [[Ed Schroder|Ed Schröder]], [[CCC]], August 04, 2012 <ref>Selective Search Techniques in REBEL (introduction) from [[Rebel#Progr
9 KB (1,219 words) - 21:02, 25 June 2020
...ngular Margin based on depth?] by [[Larry Kaufman]], [[CCC]], February 11, 2012
...s.com/catalogue/travis-reuter-rotational-templates/ Rotational Templates] (2012), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
16 KB (2,280 words) - 17:09, 16 November 2020
* [[Kunihito Hoki]], [[Masakazu Muramatsu]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Efficiency-of-three-forward-p
* [[Kieran Greer]] ('''2012'''). ''[http://www.hindawi.com/journals/aai/2013/357068/ Tree Pruning for N
16 KB (2,174 words) - 11:35, 16 June 2021
* [[Kunihito Hoki]], [[Masakazu Muramatsu]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Efficiency-of-three-forward-p
'''2012'''
40 KB (5,641 words) - 18:55, 25 December 2020
...44507 Re: Some thoughts on QS] by [[Vincent Diepeveen]], [[CCC]], July 30, 2012
7 KB (1,046 words) - 13:55, 28 December 2019
* [[Kunihito Hoki]], [[Masakazu Muramatsu]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Efficiency-of-three-forward-p
...to get futility pruning to work?] by [[Robert Purves]], [[CCC]], March 05, 2012
15 KB (2,022 words) - 09:48, 8 July 2021
...8 Qsearch Delta Pruning Rate?] by [[Srdja Matovic]], [[CCC]], December 24, 2012
3 KB (418 words) - 10:37, 25 September 2020
...m internal iterative deepening] by [[Evert Glebbeek]], [[CCC]], August 20, 2012 » [[Internal Iterative Deepening]]
...ini 3 reducing the depth feature] by Maurizio Maglio, [[CCC]], October 17, 2012 » [[Houdini]]
5 KB (644 words) - 09:49, 8 July 2021
* [[Kunihito Hoki]], [[Masakazu Muramatsu]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Efficiency-of-three-forward-p
'''2012'''
17 KB (2,291 words) - 11:20, 4 April 2022
...the null move observation] by [[Harm Geert Muller]], [[CCC]], January 11, 2012</ref>
...Without the null move observation] by Diogo Barardo, [[CCC]], January 11, 2012
3 KB (339 words) - 17:17, 4 September 2018
...utility pruning, razoring question] by [[Marco Belli]], [[CCC]], April 04, 2012 » [[Futility Pruning]]
...Razoring / Lazy eval question] by [[Jerry Donald]], [[CCC]], November 24, 2012 » [[Lazy Evaluation]]
14 KB (1,941 words) - 20:31, 6 November 2020
...php?t=42037 About UCI multipv] by [[Fermin Serrano]], [[CCC]], January 17, 2012 » [[UCI]]
...c.php?t=44487 Null move in PV] by [[Harm Geert Muller]], [[CCC]], July 18, 2012 » [[Null Move]]
16 KB (2,278 words) - 16:45, 3 November 2020
'''2012'''
...[https://en.wikipedia.org/wiki/Stack_Overflow Stack Overflow], January 18, 2012
31 KB (4,202 words) - 18:27, 12 March 2022
...m internal iterative deepening] by [[Evert Glebbeek]], [[CCC]], August 20, 2012 » [[Reductions]]
9 KB (1,332 words) - 10:40, 25 September 2020
...9 Move ordering idea (old and new?)] by [[Daniel Homan]], [[CCC]], Aug 09, 2012
5 KB (732 words) - 10:47, 16 February 2022
...9 Move ordering idea (old and new?)] by [[Daniel Homan]], [[CCC]], Aug 09, 2012
3 KB (513 words) - 15:02, 22 January 2019
* [[Tsan-sheng Hsu]] ('''2012'''). ''Transposition Table, History Heuristic, and other Search Enhancement
6 KB (795 words) - 15:07, 30 April 2018
...Greer]] further outlines the Chessmaps Heuristic <ref>[[Kieran Greer]] ('''2012'''). ''[http://www.hindawi.com/journals/aai/2013/357068/ Tree Pruning for N
* [[Kieran Greer]] ('''2012'''). ''[http://www.hindawi.com/journals/aai/2013/357068/ Tree Pruning for N
11 KB (1,358 words) - 23:25, 5 February 2020
* [[David Levy]] ('''2012'''). ''No Miscarriage of Justice - Just Biased Reporting''. [http://www.har
* [[David Levy]] ('''2012'''). ''From Computer Games to a Global Brain''. [[ICGA Journal#35_4|ICGA Jo
35 KB (4,953 words) - 10:55, 21 March 2021
'''2012'''
* [[Jaap van den Herik]], [[Aske Plaat]] ('''2012'''). ''The 13th Advances in Computer Games Conference''. [[ICGA Journal#35_
62 KB (8,279 words) - 13:30, 17 November 2021
...epth and diminishing return effects] by [[Ed Schroder|Ed Schröder]], June 2012</ref> .
...nction of number of legal moves] by [[Pio Korinth]], [[CCC]], February 28, 2012
28 KB (3,741 words) - 10:51, 16 February 2022
...de Man|syzygy]], [[Computer Chess Forums|OpenChess Forum]], September 22, 2012</ref> Chapter 4.3 Cycles
...ph History Interaction Problem] by [[Cary Cherng]], [[CCC]], September 21, 2012
4 KB (541 words) - 20:03, 17 June 2021
...el recipe to fix TT draws scores] by [[Marco Costalba]], [[CCC]], June 23, 2012 » [[Texel]]
3 KB (359 words) - 11:50, 2 May 2018
