25,161
edits
Changes
no edit summary
=Selected Publications=
<ref>[httphttps://www.informatikdblp.uni-trier.de/~ley/pers/hd/b/Beal:Donald_F=.html DBLPdblp: Donald F. Beal]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.dcs.qmul.ac.uk/staff/publist.php?d=don Don Beal's Publications]</ref>
==1978==
* [[Don Beal]] ('''1978'''). ''Handicapping Computer Chess Programs''. [[ICGA Journal#1_2|ICCA Newsletter, Vol. 1, No. 2]]
* [[Don Beal]] ('''1984'''). ''Mixing Heuristic and Perfect Evaluations: Nested Minimax''. [[ICGA Journal#7_1|ICCA Journal, Vol. 7, No. 1]]
* [[Don Beal]] ('''1984'''). ''Mating Sequences in the Quiescence Search''. [[ICGA Journal#7_3|ICCA Journal, Vol. 7, No. 3]]
==1985 ...==
* [[Don Beal]] ('''1986'''). ''Selective Search without Tears.'' [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]]
* [[Don Beal]] ('''1986'''). ''Turbo GameWorks: Tools for Turbo Pascal''. (Review) [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]] » [[Turbo Chess]]
* [[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, edited version in ('''1999'''). ''The Nature of MINIMAX Search''. Ph.D. thesis, Chapter 10
* [[David Levy]], [[Don Beal]] (Edseds.) ('''1989'''). ''Heuristic Programming in Artificial Intelligence - The First Computer Olympiad''. Ellis Horwood » [[1st Computer Olympiad#Workshop|1st Computer Olympiad]]
==1990 ...==
* [[Don Beal]] ('''1990'''). ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1
* [[David Levy]], [[Don Beal]] (Edseds.) ('''1991'''). ''Heuristic Programming in Artificial Intelligence - The Second Computer Olympiad''. Ellis Horwood » [[2nd Computer Olympiad#Workshop|2nd Computer Olympiad]]
* [[Don Beal]] ('''1991'''). ''Report on the 11th World Microcomputer Chess Championship''. [[ICGA Journal#14_2|ICCA Journal, Vol. 14, No. 2]] » [[WMCCC 1991]]
* [[Don Beal]] ('''1991'''). ''Report on the 22nd ACM International Computer Chess Championship''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]] » [[ACM 1991]]
* [[Don Beal]] ('''1994'''). ''The QMW's Uniform-Platform Computer-Chess Tournament''. [[ICGA Journal#17_1|ICCA Journal, Vol. 17, No. 1]]
* [[Don Beal]] ('''1994'''). ''Report on the QMW Uniform-Platform World Championship 1994''. [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]] » [[UPCCC 1994]]
==1995 ...==
* [[Don Beal]] ('''1995'''). ''An Integrated-Bounds-and-Values (IBV) Numeric Scale for Minimax Searches.'' [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]] » [[Integrated Bounds and Values]]
* [http://www.ece.ust.hk/%7Eeetsang/ Hin-Kwok Tsang] and [[Don Beal]] ('''1995'''). ''The 8th World Computer-Chess Championship''. [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]] » [[WCCC 1995]]
* [[Don Beal]], [[Martin C. Smith]] ('''1996'''). ''Multiple Probes of Transposition Tables''. [[ICGA Journal#19_4|ICCA Journal, Vol. 19, No. 4]]
* [[Don Beal]], [[Martin C. Smith]] ('''1997'''). ''Learning Piece Values Using Temporal Differences''. [[ICGA Journal#20_3|ICCA Journal, Vol. 20, No. 3]]
* [[Don Beal]], [[Martin C. Smith]] ('''1998'''). ''[httphttps://link.springer.com/chapter/10.1007/3%2F3-540-48957-6_7 First Results from Using Temporal Difference Learning in Shogi]''. [[CG 1998]]
* [[Don Beal]] ('''1999'''). ''The 9th World Computer-Chess Championship: the Search-Engine Features of the Programs''. [[ICGA Journal#22_3|ICCA Journal, Vol. 22, No. 3]] » [[WCCC 1999]]
* [[Don Beal]], [[Martin C. Smith]] ('''1999'''). ''Learning Piece-Square Values using Temporal Differences.'' [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]
* [[Don Beal]], [[Martin C. Smith]] ('''1999'''). ''[httphttps://portaldl.acm.org/citation.cfm?id=1624299 Temporal Coherence and Prediction Decay in TD Learning]''. [[Conferences#IJCAI1999|IJCAI 1999]], [httphttps://www.ijcai.org/Past%20ProceedingsProceedings/IJCAI-99-VOL-1/PDFPapers/081.pdf pdf]
* [[Don Beal]] ('''1999'''). ''The Nature of MINIMAX Search''. Ph.D. thesis, IKAT, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Beal_thesis.pdf pdf]
==2000 ...==
* [[Don Beal]], [[Martin C. Smith]] ('''2001'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397500000785 Temporal difference learning applied to game playing and the results of application to Shogi]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Computer Science], Vol. 252, Nos. 1-2
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''Computer Analysis of some Chinese Chess Endgames''. [[Advances in Computer Games 9]]
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-3.htm#FAST Fast, Memory-efficient Retrograde Algorithms]''.[[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]] <ref>[https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6302&p=29956 Wu / Beal retrograde analisys algorithm] by [[Alvaro Cardoso|Alvaro Jose Povoa Cardoso]], [[Computer Chess Forums|Winboard Forum]], March 10, 2007</ref>
* [[Don Beal]] ('''2002'''). ''Learn from your opponent - but what if he/she/it knows less than you?'' in [[Jean Retschitzki]], [[Rosita Haddad-Zubel]] (eds.) ''Step by Step''.
* [[Ren Wu]], [[Don Beal]] ('''2002'''). ''A memory efficient retrograde algorithm and its application to solve Chinese Chess endgames.'' in [[Richard J. Nowakowski]] (ed.) [http://library.msri.org/books/Book42/ More Games of No Chance]
* [[Don Beal]] ('''2002'''). ''[https://www.researchgate.net/publication/221556841_TD_mu_A_Modificaiton_of_TD_lambda_That_Enables_a_Program_to_Learn_Weights_for_Good_Play_Even_if_It_Observes_Only_Bad_Play TD(µ): A Modification of TD(λ) That Enables a Program to Learn Weights for Good Play Even if It Observes Only Bad Play]''. [https://dblp.org/db/conf/jcis/jcis2002 JCIS 2002]
==2005 ...==
* [[Don Beal]] ('''2006'''). ''Review of a nullmove-quiescence search mechanism from 1986''. [[FILE:alg1986review.txt]] (Draft) <ref>courtesy of [[Don Beal]] and [[Carey Bloodworth]], [http://www.talkchess.com/forum/viewtopic.php?t=58603&start=13 Re: Antique chess programs] by [[Carey Bloodworth|Carey]], [[CCC]], December 16, 2015</ref>
[[Category:Researcher|Beal]]
[[Category:Chess Programmer|Beal]]
[[Category:Lines of Action Programmer|Beal]]
[[Category:Tournament Director|Beal]]
