* [[George Arnold]]
* [[Michael Bain]]
49 KB (5,337 words) - 14:00, 16 February 2022
...f Theoretical and Experimental Physics]] (ITEP) by [[Georgy Adelson-Velsky|George Adelson-Velsky]] and others. In 1967, a [[Stanford-ITEP Match|four-game mat
...ute of Technology]], [[Alan Kotok]] and his fellows [[Elwyn Berlekamp]], [[Michael A. Lieberman]], [[Charles Niessen]] and [[Robert A. Wagner]] wrote a chess
5 KB (654 words) - 14:27, 25 January 2020
...f Theoretical and Experimental Physics]] (ITEP) by [[Georgy Adelson-Velsky|George Adelson-Velsky]] and others. In 1967, a [[Stanford-ITEP Match|four-game mat
...s Institute of Technology]], [[Alan Kotok]], [[Elwyn Berlekamp]] (1960), [[Michael A. Lieberman]], [[Charles Niessen]] and [[Robert A. Wagner]], wrote a chess
13 KB (1,808 words) - 14:28, 25 January 2020
* [https://en.wikipedia.org/wiki/George_Hermonymus George Hermonymus (15th-century)] [https://www.mathgenealogy.org/id.php?id=131443
******* [https://en.wikipedia.org/wiki/Michael_Servetus Michael Servetus (1509 - 1553)] [https://www.mathgenealogy.org/id.php?id=126064 ¶]
805 KB (106,796 words) - 11:23, 6 August 2021
| [[Michael Valenti]], [[Zvonko Vranesic]]
| [[Monroe Newborn|Monty Newborn]], [[George Arnold]]
15 KB (1,888 words) - 11:27, 28 January 2020
| [[Michael Valenti]], [[Zvonko Vranesic]]
| [[George Arnold]], [[Monroe Newborn]]
14 KB (1,990 words) - 11:52, 28 January 2020
...ttps://en.wikipedia.org/wiki/Mainframe_computer mainframe computer] <ref>[[George Atkinson]] ('''1998'''). ''[http://books.google.com/books?id=ZuTvVo4zo6oC&p
.../ref> by English mountaineer [https://en.wikipedia.org/wiki/George_Mallory George Mallory], having replied to the question "Why do you want to climb [https:/
7 KB (1,000 words) - 15:05, 26 September 2020
...hute was subject of Valenti's Masters Thesis supervised by Vranesic <ref>[[Michael Valenti]] ('''1974'''). ''CHUTE I, An Easily Modifiable Chess Playing Progr
...CCC 1977]] in the Proceedings of the 1977 annual [[ACM]] conference <ref>[[Michael Valenti]], [[Zvonko Vranesic]] ('''1977'''). ''[http://portal.acm.org/citat
6 KB (767 words) - 12:47, 25 April 2019
...nik]], [[Boris Stilman]], [[Alexander Yudin]], [[Alexander Reznitskiy]], [[Michael Tsfasman]] ('''1980'''). ''Thinking of Man and Computer'', Proc. of the Sec
* [[Michael Genesereth]], [[Mathematician#NilsNilsson|Nils J. Nilsson]] ('''1987'''). '
76 KB (10,439 words) - 14:01, 10 August 2023
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-ba
* [[Joel Veness]], [[Marc Lanctot]], [[Michael Bowling]] ('''2011'''). ''Variance Reduction in Monte-Carlo Tree Search''.
76 KB (10,188 words) - 16:36, 1 December 2021
.../en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions (in '''1965''') as ''Thought and Choice in Chess''
* [[George Stockman]] ('''1979'''). ''A Minimax Algorithm Better than Alpha-Beta?'' [h
34 KB (4,570 words) - 22:36, 17 May 2023
* [[Stephen Muggleton]], [[Michael Bain]], [[Jean Hayes Michie]], [[Donald Michie]] ('''1989'''). ''An Experim
* [[Michael Bain]] ('''1992'''). ''Learning optimal chess strategies.'' Proc. Intl. Wor
137 KB (18,484 words) - 00:18, 19 December 2021
..., 1966, the description of [[Mater#MaterII|Mater II]] <ref>[[George Baylor|George W. Baylor]], [[Herbert Simon|Herbert A. Simon]] ('''1966'''). ''[http://dl.
* [[George Baylor|George W. Baylor]], [[Herbert Simon|Herbert A. Simon]] ('''1966'''). ''[http://dl.
40 KB (5,641 words) - 18:55, 25 December 2020
* Michael Beeler, [[Bill Gosper]], [https://en.wikipedia.org/wiki/Richard_Schroeppel
...ounting the number of bits in a 32-bit word] by [[Mathematician#GMarsaglia|George Marsaglia]], [http://groups.google.com/group/comp.lang.c/topics comp.lang.c
39 KB (5,372 words) - 19:58, 16 November 2020
...rec.com/wbforum/viewtopic.php?f=18&t=35352 Stalemate trap(SOS-Delfi)] by [[George Lyapko]], [[Computer Chess Forums|Winboard Forum]], December 18, 2001 » [[
....talkchess.com/forum/viewtopic.php?t=38850 The unavoidable stalemate] by [[Michael Scheidl|Mike Scheidl]], [[CCC]], April 24, 2011
12 KB (1,753 words) - 21:35, 23 February 2021
* [http://members.aon.at/computerschach/quick/quicke.htm Quicktest] by [[Michael Scheidl]]
...rec.com/wbforum/viewtopic.php?f=18&t=35352 Stalemate trap(SOS-Delfi)] by [[George Lyapko]], [[Computer Chess Forums|Winboard Forum]], December 18, 2001 » [[
20 KB (2,671 words) - 21:31, 5 August 2021
.../sun.aei.polsl.pl/~zjc/ Zbigniew J. Czech], [http://itee.uq.edu.au/~havas/ George Havas], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Majews
.../sun.aei.polsl.pl/~zjc/ Zbigniew J. Czech], [http://itee.uq.edu.au/~havas/ George Havas], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Majews
24 KB (3,307 words) - 21:17, 7 October 2020
...1956 by psychologist [https://en.wikipedia.org/wiki/George_Armitage_Miller George A. Miller] in [https://en.wikipedia.org/wiki/The_Magical_Number_Seven,_Plus
.../en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess'
22 KB (2,972 words) - 13:20, 22 November 2020
.../en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess'
.../en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess'
25 KB (3,365 words) - 11:19, 6 August 2021
...inally adapted from: [https://en.wikipedia.org/wiki/George_Armitage_Miller George Armitage Miller] ('''2003'''). ''The cognitive revolution: a historical per
.../en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess'
59 KB (8,002 words) - 09:43, 5 July 2021
