25,161
edits
Changes
Created page with "'''Home * People * Michael Buro''' FILE:Logistello.jpg|border|right|thumb|link=https://skatgame.net/mburo/players.html| Logistello by Michael Buro <ref>[..."
'''[[Main Page|Home]] * [[People]] * Michael Buro'''
[[FILE:Logistello.jpg|border|right|thumb|link=https://skatgame.net/mburo/players.html| Logistello by Michael Buro <ref>[https://skatgame.net/mburo/players.html Logistello - Murakami About the players]</ref> ]]
'''Michael Buro''',<br/>
a German computer scientist, [[Artificial Intelligence|AI]]-researcher, and professor at the Department of Computing Science at [[University of Alberta]]. Michael Buro is creator of the [[ProbCut]] selective extension of the [[Alpha-Beta|alpha-beta]] algorithm, applied to his [[Othello]] program ''Logistello'' <ref>[https://skatgame.net/mburo/log.html Logistello's Homepage]</ref> as part of his Ph.D. thesis at [[Paderborn University]] <ref>[[Michael Buro]] ('''1994'''). ''Techniken für die Bewertung von Spielsituationen anhand von Beispielen.'' Ph.D. Thesis. [[Paderborn University]](German)</ref>. In 1997, Logistello won 6-0 from the then Othello World champion ''Takeshi Murakami'' <ref>[[Michael Buro]] ('''1997'''). ''The Othello match of the year: Takeshi Murakami vs Logistello''. [[ICGA Journal#20_3|ICCA Journal, Vol 20, No. 3]]</ref> <ref>[https://skatgame.net/mburo/event.html Othello match of the year]</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/edCIIJdxSHY/31ioIUVhBD8J Othello man machine match] by [[Ingo Althöfer]], [[Computer Chess Forums|rgcc]], August 6, 1997</ref>.
=GLEM=
Michael Buro's ''General Linear Evaluation Model'' ('''GLEM'''), introduced at the [[CG 1998|Computer and Games 1998]] conference in [https://en.wikipedia.org/wiki/Tsukuba,_Ibaraki Tsukuba], [https://en.wikipedia.org/wiki/Japan Japan] <ref>[[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]</ref>, also applied to Othello, covers not only [[Automated Tuning|automated tuning]] quite similar to [[Texel's Tuning Method]] which popularized [[Automated Tuning#LogisticRegression|logistic regression]] tuning in computer chess some years later, but further provides a procedure for exploring the feature space able to discover new [[Evaluation|evaluation]] features in a computational feasible way.
=Selected Publication=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://skatgame.net/mburo/publications.html Michael Buro's Publication List]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Buro:Michael.html dblp: Michael Buro]</ref>
==1990 ...==
* [[Michael Buro]] ('''1990'''). ''A contribution to the determination of Rado's Sigma - or - How to catch busy beavers''? Diploma thesis, [https://en.wikipedia.org/wiki/RWTH_Aachen_University RWTH Aachen] (German) <ref>[https://en.wikipedia.org/wiki/Busy_beaver Busy beaver from Wikipedia]</ref> <ref>[http://www.drb.insel.de/~heiner/BB/index.html Busy Beaver] by [[Heiner Marxen]]</ref>
* [[Michael Buro]] ('''1993'''). '' On the Maximum Length of Huffman Codes''. Information Processing Letters, Vol. 45
* [[Michael Buro]] ('''1994'''). ''Techniken für die Bewertung von Spielsituationen anhand von Beispielen.'' Ph.D. thesis. [[Paderborn University]] (German)
==1995 ...==
* [[Michael Buro]] ('''1995'''). ''[http://www.jair.org/papers/paper179.html Statistical Feature Combination for the Evaluation of Game Positions]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 3
* [[Michael Buro]] ('''1995'''). ''ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm.'' [[ICGA Journal#18_2|ICCA Journal, Vol 18, No. 2]], [https://skatgame.net/mburo/ps/probcut.pdf pdf]
* [[Michael Buro]] ('''1997'''). ''An Evaluation Function for Othello Based on Statistics.'' NEC Research Institute. Technical Report #31.
* [[Michael Buro]] ('''1997'''). ''Experiments with Multi-ProbCut and a New High-quality Evaluation Function for Othello.'' Technical Report No. 96, NEC Research Institute, [https://skatgame.net/mburo/ps/improve.pdf pdf]
* [[Michael Buro]] ('''1997'''). ''The Othello match of the year: Takeshi Murakami vs Logistello''. [[ICGA Journal#20_3|ICCA Journal, Vol 20, No. 3]], [https://skatgame.net/mburo/ps/match-report.pdf pdf]
* [[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]
* [[Michael Buro]] ('''1999'''). ''Toward Opening Book Learning.'' [[ICGA Journal#22_2|ICCA Journal, Vol 22, No. 2]], [https://skatgame.net/mburo/ps/book.pdf pdf] » [[Book Learning]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=50680 Anybody tried Logistello's book learning for chess?] by [[Rémi Coulom]], [[CCC]], December 29, 2013</ref>
* [[Michael Buro]] ('''1999'''). ''Efficient Approximation of Backgammon Race Equities.'' [[ICGA Journal#22_3|ICCA Journal, Vol 22, No. 3]], also published (2000) in Games in AI Research, [https://skatgame.net/mburo/ps/bgequ.pdf pdf]
==2000 ...==
* [[Michael Buro]] ('''2000'''). ''Experiments with Multi-ProbCut and a new High-Quality Evaluation Function for Othello.'' Games in AI Research, [https://skatgame.net/mburo/ps/improve.pdf pdf]
* [[Michael Buro]] ('''2000'''). ''Toward Opening Book Learning.'' Games in AI Research, [https://skatgame.net/mburo/ps/book.pdf pdf]
* [[Michael Buro]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_17 Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs]''. [[CG 2000]], [https://skatgame.net/mburo/ps/amaend.pdf pdf]
* [[Michael Buro]] ('''2001'''). ''Efficient Approximation of Backgammon Race Equities.'' [[Advances in Computer Games 9]]
* [[Michael Buro]], [[Igor Durdanovic]] ('''2001'''). ''An Overview of NECI’s Generic Game Server''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]], [https://skatgame.net/mburo/ps/ggs.pdf pdf]
* [[Michael Buro]] ('''2002'''). ''Improving Mini-max Search by Supervised Learning.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 134, No. 1
* [[Michael Buro]] ('''2002'''). ''Report on the IWEC-2002 Man-Machine Othello Match''. [[ICGA Journal#25_2|ICGA Journal, Vol. 25, No. 2]], [https://skatgame.net/mburo/ps/iwec-match.pdf pdf]
* [[Michael Buro]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_19 ORTS: A Hack-Free RTS Game Environment]''. [[CG 2002]], [https://skatgame.net/mburo/ps/orts.pdf pdf]
* [[Dave Gomboc]], [[Tony Marsland]], [[Michael Buro]] ('''2003'''). ''Evaluation Function Tuning via Ordinal Correlation''. [[University of Alberta]], Edmonton, Alberta, Canada, [[Advances in Computer Games 10]], [http://www.top-5000.nl/ps/Dave%20Gomboc%20-%20Evaluation%20Tuning.pdf pdf]
* [[Michael Buro]] ('''2003'''). ''The Evolution of Strong Othello Programs''. [[IFIP]], Vol. 112, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Albert Xin Jiang]], [[Michael Buro]] ('''2003'''). ''First Experimental Results of ProbCut Applied to Chess''. [[Advances in Computer Games 10]], [http://cs.ubc.ca/~jiang/papers/mpc_main.pdf pdf]
* [[Thomas Hauk]], [[Michael Buro]], [[Jonathan Schaeffer]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_3 Rediscovering *-Minimax Search]''. [[CG 2004]], [http://skatgame.net/mburo/ps/STAR-A.pdf pdf]
* [[Thomas Hauk]], [[Michael Buro]], [[Jonathan Schaeffer]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_4 *-Minimax Performance in Backgammon]''. [[CG 2004]]
==2005 ...==
* [[Dave Gomboc]], [[Michael Buro]], [[Tony Marsland]] ('''2005'''). ''Tuning evaluation functions by maximizing concordance'' Theoretical Computer Science, Vol. 349, No. 2, [https://skatgame.net/mburo/ps/tcs-learn.pdf pdf]
* [[Frantisek Sailer]], [[Michael Buro]], [[Marc Lanctot]] ('''2007'''). ''Adversarial planning through strategy simulation''. [[IEEE#CIG|CIG 2007]], [https://skatgame.net/mburo/ps/rtsmc.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2009'''). ''Minimum Proof Graphs and Fastest-Cut-First Search Heuristics''. [[Conferences#IJCAI2009|IJCAI 2009]], [http://ijcai.org/papers09/Papers/IJCAI09-089.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57228&start=6 Re: Move ordering for cheapest refutation] by [[Mikko Aarnos]], [[CCC]], August 10, 2015</ref>
==2010 ...==
* [[Jeffrey Long]], [[Nathan Sturtevant]], [[Michael Buro]], [[Timothy Furtak]] ('''2010'''). ''Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search''. [[Conferences#AAAI-2010|AAAI 2010]], [https://skatgame.net/mburo/ps/aaai10-mc.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2011'''). ''Using Payoff-Similarity to Speed Up Search''. [[Conferences#IJCAI2011|IJCAI 2011]], [http://ijcai.org/papers11/Papers/IJCAI11-097.pdf pdf] » [https://en.wikipedia.org/wiki/Skat_%28card_game%29 Skat], [[Transposition Table]]
* [[Abdallah Saffidine]], [[Hilmar Finnsson]], [[Michael Buro]] ('''2012'''). ''Alpha-Beta Pruning for Games with Simultaneous Moves''. [[Conferences#AAAI-2012|AAAI 2012]]
* [[Timothy Furtak]], [[Michael Buro]] ('''2013'''). ''Recursive Monte Carlo search for imperfect information games''. [[IEEE#CIG|CIG 2013]], [https://skatgame.net/mburo/ps/recmc13.pdf pdf]
=External Links=
* [https://skatgame.net/mburo/ Michael Buro's homepage]
* [https://www.ualberta.ca/science/about-us/contact-us/faculty-directory/michael-buro Michael Buro - Faculty of Science UoA]
* [https://plus.google.com/+MichaelBuro/about Michael Buro – Google+]
* [http://webdocs.cs.ualberta.ca/%7Edarse/Photos/Friends/ Photo Gallery: Friends and Peers] by [[Darse Billings]]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:Logistello.jpg|border|right|thumb|link=https://skatgame.net/mburo/players.html| Logistello by Michael Buro <ref>[https://skatgame.net/mburo/players.html Logistello - Murakami About the players]</ref> ]]
'''Michael Buro''',<br/>
a German computer scientist, [[Artificial Intelligence|AI]]-researcher, and professor at the Department of Computing Science at [[University of Alberta]]. Michael Buro is creator of the [[ProbCut]] selective extension of the [[Alpha-Beta|alpha-beta]] algorithm, applied to his [[Othello]] program ''Logistello'' <ref>[https://skatgame.net/mburo/log.html Logistello's Homepage]</ref> as part of his Ph.D. thesis at [[Paderborn University]] <ref>[[Michael Buro]] ('''1994'''). ''Techniken für die Bewertung von Spielsituationen anhand von Beispielen.'' Ph.D. Thesis. [[Paderborn University]](German)</ref>. In 1997, Logistello won 6-0 from the then Othello World champion ''Takeshi Murakami'' <ref>[[Michael Buro]] ('''1997'''). ''The Othello match of the year: Takeshi Murakami vs Logistello''. [[ICGA Journal#20_3|ICCA Journal, Vol 20, No. 3]]</ref> <ref>[https://skatgame.net/mburo/event.html Othello match of the year]</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/edCIIJdxSHY/31ioIUVhBD8J Othello man machine match] by [[Ingo Althöfer]], [[Computer Chess Forums|rgcc]], August 6, 1997</ref>.
=GLEM=
Michael Buro's ''General Linear Evaluation Model'' ('''GLEM'''), introduced at the [[CG 1998|Computer and Games 1998]] conference in [https://en.wikipedia.org/wiki/Tsukuba,_Ibaraki Tsukuba], [https://en.wikipedia.org/wiki/Japan Japan] <ref>[[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]</ref>, also applied to Othello, covers not only [[Automated Tuning|automated tuning]] quite similar to [[Texel's Tuning Method]] which popularized [[Automated Tuning#LogisticRegression|logistic regression]] tuning in computer chess some years later, but further provides a procedure for exploring the feature space able to discover new [[Evaluation|evaluation]] features in a computational feasible way.
=Selected Publication=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://skatgame.net/mburo/publications.html Michael Buro's Publication List]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Buro:Michael.html dblp: Michael Buro]</ref>
==1990 ...==
* [[Michael Buro]] ('''1990'''). ''A contribution to the determination of Rado's Sigma - or - How to catch busy beavers''? Diploma thesis, [https://en.wikipedia.org/wiki/RWTH_Aachen_University RWTH Aachen] (German) <ref>[https://en.wikipedia.org/wiki/Busy_beaver Busy beaver from Wikipedia]</ref> <ref>[http://www.drb.insel.de/~heiner/BB/index.html Busy Beaver] by [[Heiner Marxen]]</ref>
* [[Michael Buro]] ('''1993'''). '' On the Maximum Length of Huffman Codes''. Information Processing Letters, Vol. 45
* [[Michael Buro]] ('''1994'''). ''Techniken für die Bewertung von Spielsituationen anhand von Beispielen.'' Ph.D. thesis. [[Paderborn University]] (German)
==1995 ...==
* [[Michael Buro]] ('''1995'''). ''[http://www.jair.org/papers/paper179.html Statistical Feature Combination for the Evaluation of Game Positions]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 3
* [[Michael Buro]] ('''1995'''). ''ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm.'' [[ICGA Journal#18_2|ICCA Journal, Vol 18, No. 2]], [https://skatgame.net/mburo/ps/probcut.pdf pdf]
* [[Michael Buro]] ('''1997'''). ''An Evaluation Function for Othello Based on Statistics.'' NEC Research Institute. Technical Report #31.
* [[Michael Buro]] ('''1997'''). ''Experiments with Multi-ProbCut and a New High-quality Evaluation Function for Othello.'' Technical Report No. 96, NEC Research Institute, [https://skatgame.net/mburo/ps/improve.pdf pdf]
* [[Michael Buro]] ('''1997'''). ''The Othello match of the year: Takeshi Murakami vs Logistello''. [[ICGA Journal#20_3|ICCA Journal, Vol 20, No. 3]], [https://skatgame.net/mburo/ps/match-report.pdf pdf]
* [[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]
* [[Michael Buro]] ('''1999'''). ''Toward Opening Book Learning.'' [[ICGA Journal#22_2|ICCA Journal, Vol 22, No. 2]], [https://skatgame.net/mburo/ps/book.pdf pdf] » [[Book Learning]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=50680 Anybody tried Logistello's book learning for chess?] by [[Rémi Coulom]], [[CCC]], December 29, 2013</ref>
* [[Michael Buro]] ('''1999'''). ''Efficient Approximation of Backgammon Race Equities.'' [[ICGA Journal#22_3|ICCA Journal, Vol 22, No. 3]], also published (2000) in Games in AI Research, [https://skatgame.net/mburo/ps/bgequ.pdf pdf]
==2000 ...==
* [[Michael Buro]] ('''2000'''). ''Experiments with Multi-ProbCut and a new High-Quality Evaluation Function for Othello.'' Games in AI Research, [https://skatgame.net/mburo/ps/improve.pdf pdf]
* [[Michael Buro]] ('''2000'''). ''Toward Opening Book Learning.'' Games in AI Research, [https://skatgame.net/mburo/ps/book.pdf pdf]
* [[Michael Buro]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_17 Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs]''. [[CG 2000]], [https://skatgame.net/mburo/ps/amaend.pdf pdf]
* [[Michael Buro]] ('''2001'''). ''Efficient Approximation of Backgammon Race Equities.'' [[Advances in Computer Games 9]]
* [[Michael Buro]], [[Igor Durdanovic]] ('''2001'''). ''An Overview of NECI’s Generic Game Server''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]], [https://skatgame.net/mburo/ps/ggs.pdf pdf]
* [[Michael Buro]] ('''2002'''). ''Improving Mini-max Search by Supervised Learning.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 134, No. 1
* [[Michael Buro]] ('''2002'''). ''Report on the IWEC-2002 Man-Machine Othello Match''. [[ICGA Journal#25_2|ICGA Journal, Vol. 25, No. 2]], [https://skatgame.net/mburo/ps/iwec-match.pdf pdf]
* [[Michael Buro]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_19 ORTS: A Hack-Free RTS Game Environment]''. [[CG 2002]], [https://skatgame.net/mburo/ps/orts.pdf pdf]
* [[Dave Gomboc]], [[Tony Marsland]], [[Michael Buro]] ('''2003'''). ''Evaluation Function Tuning via Ordinal Correlation''. [[University of Alberta]], Edmonton, Alberta, Canada, [[Advances in Computer Games 10]], [http://www.top-5000.nl/ps/Dave%20Gomboc%20-%20Evaluation%20Tuning.pdf pdf]
* [[Michael Buro]] ('''2003'''). ''The Evolution of Strong Othello Programs''. [[IFIP]], Vol. 112, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Albert Xin Jiang]], [[Michael Buro]] ('''2003'''). ''First Experimental Results of ProbCut Applied to Chess''. [[Advances in Computer Games 10]], [http://cs.ubc.ca/~jiang/papers/mpc_main.pdf pdf]
* [[Thomas Hauk]], [[Michael Buro]], [[Jonathan Schaeffer]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_3 Rediscovering *-Minimax Search]''. [[CG 2004]], [http://skatgame.net/mburo/ps/STAR-A.pdf pdf]
* [[Thomas Hauk]], [[Michael Buro]], [[Jonathan Schaeffer]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_4 *-Minimax Performance in Backgammon]''. [[CG 2004]]
==2005 ...==
* [[Dave Gomboc]], [[Michael Buro]], [[Tony Marsland]] ('''2005'''). ''Tuning evaluation functions by maximizing concordance'' Theoretical Computer Science, Vol. 349, No. 2, [https://skatgame.net/mburo/ps/tcs-learn.pdf pdf]
* [[Frantisek Sailer]], [[Michael Buro]], [[Marc Lanctot]] ('''2007'''). ''Adversarial planning through strategy simulation''. [[IEEE#CIG|CIG 2007]], [https://skatgame.net/mburo/ps/rtsmc.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2009'''). ''Minimum Proof Graphs and Fastest-Cut-First Search Heuristics''. [[Conferences#IJCAI2009|IJCAI 2009]], [http://ijcai.org/papers09/Papers/IJCAI09-089.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57228&start=6 Re: Move ordering for cheapest refutation] by [[Mikko Aarnos]], [[CCC]], August 10, 2015</ref>
==2010 ...==
* [[Jeffrey Long]], [[Nathan Sturtevant]], [[Michael Buro]], [[Timothy Furtak]] ('''2010'''). ''Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search''. [[Conferences#AAAI-2010|AAAI 2010]], [https://skatgame.net/mburo/ps/aaai10-mc.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2011'''). ''Using Payoff-Similarity to Speed Up Search''. [[Conferences#IJCAI2011|IJCAI 2011]], [http://ijcai.org/papers11/Papers/IJCAI11-097.pdf pdf] » [https://en.wikipedia.org/wiki/Skat_%28card_game%29 Skat], [[Transposition Table]]
* [[Abdallah Saffidine]], [[Hilmar Finnsson]], [[Michael Buro]] ('''2012'''). ''Alpha-Beta Pruning for Games with Simultaneous Moves''. [[Conferences#AAAI-2012|AAAI 2012]]
* [[Timothy Furtak]], [[Michael Buro]] ('''2013'''). ''Recursive Monte Carlo search for imperfect information games''. [[IEEE#CIG|CIG 2013]], [https://skatgame.net/mburo/ps/recmc13.pdf pdf]
=External Links=
* [https://skatgame.net/mburo/ Michael Buro's homepage]
* [https://www.ualberta.ca/science/about-us/contact-us/faculty-directory/michael-buro Michael Buro - Faculty of Science UoA]
* [https://plus.google.com/+MichaelBuro/about Michael Buro – Google+]
* [http://webdocs.cs.ualberta.ca/%7Edarse/Photos/Friends/ Photo Gallery: Friends and Peers] by [[Darse Billings]]
=References=
<references />
'''[[People|Up one level]]'''
