* [[Gunnar Andersson]]
* [[Daniel Anulliero]]
49 KB (5,337 words) - 14:00, 16 February 2022
* [[Daniel Andersson]] ('''2009''') ''Perfect-Information Games with Cycles''. Ph.D. thesis, [ht
9 KB (1,273 words) - 22:10, 1 October 2018
****** <span style="background-color: #ccffcc;">[[#Sennert|Daniel Sennert]]</span>
* <span id="Sennert"></span>[https://en.wikipedia.org/wiki/Daniel_Sennert Daniel Sennert (1572 - 1637)] [https://www.mathgenealogy.org/id.php?id=126111 ¶]
805 KB (106,796 words) - 11:23, 6 August 2021
...alkchess.com/forum/viewtopic.php?t=38554 UCT surprise for checkers !] by [[Daniel Shawul]], [[CCC]], March 25, 2011</ref> and other [[Games]] with some diffi
...chess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
76 KB (10,188 words) - 16:36, 1 December 2021
* [[Daniel Edwards]], [[Timothy Hart]] ('''1961'''). ''The Alpha-Beta Heuristic'', AIM
...cc/index.php?id=233322 Re: A new(?) technique to recognize draws] by [[Dan Andersson]], June 01, 2002</ref>
34 KB (4,570 words) - 22:36, 17 May 2023
* [[Daniel Andersson]] ('''2009'''). ''Perfect-Information Games with Cycles''. Ph.D. thesis, [h
4 KB (541 words) - 20:03, 17 June 2021
* [[Daniel Andersson]] ('''2009'''). ''Perfect-Information Games with Cycles''. Ph.D. thesis, [h
...es.chess.computer/browse_frm/thread/c431ac1739de871b triple repetition] by Daniel Kang, [[Computer Chess Forums|rgcc]], October 26, 1997
34 KB (4,898 words) - 12:51, 21 August 2022
* [https://www.stmintz.com/ccc/index.php?id=340896 piece mobility?] by [[Daniel Shawul]], [[CCC]], January 08, 2004
...dagast.se/othello/bitmob.c bitboard mobility] Copyright (c) 2003, [[Gunnar Andersson]] » [[Othello]]
20 KB (2,851 words) - 19:42, 2 July 2021
* [[Daniel Andersson]] ('''2009''') ''Perfect-Information Games with Cycles''. Ph.D. thesis, [ht
...ivasan]], [[Finbarr Timbers]], [[Karl Tuyls]], [[Shayegan Omidshafiei]], [[Daniel Hennes]], [[Dustin Morrill]], [[Paul Muller]], [[Timo Ewalds]], [[Ryan Faul
68 KB (9,325 words) - 19:50, 4 April 2022
...d interesting challenge. Beside the dedicated Othello programmers [[Gunnar Andersson]], [[Michael Buro]], [[Mark Brockington]], [[Paul Hsieh]], and [[Andrea Zin
...msg/comp.ai.games/WZeBxfkzfYY/VaCfy1ds2ZYJ stability in a Othello game] by Daniel, [[Compuer Chess Forums|comp.ai.games]], October 10, 2002</ref>, current [[
36 KB (5,000 words) - 01:08, 8 December 2020
