Please use this identifier to cite or link to this item:
|Title:||M2ICAL analyses HC-gammon|
|Source:||Oon, W.-C.,Henz, M. (2007). M2ICAL analyses HC-gammon. Proceedings of the National Conference on Artificial Intelligence 1 : 621-626. ScholarBank@NUS Repository.|
|Abstract:||We analyse Pollack and Blair's HC-Gammon backgammon program using a new technique that performs Monte Carlo simulations to derive a Markov Chain model for Imperfect Comparison ALgorithms, called the M2ICAL method, which models the behavior of the algorithm using a Markov chain, each of whose states represents a class of players of similar strength. The Markov chain transition matrix is populated using Monte Carlo simulations. Once generated, the matrix allows fairly accurate predictions of the expected solution quality, standard deviation and time to convergence of the algorithm. This allows us to make some observations on the validity of Pollack and Blair's conclusions, and also shows the application of the M2ICAL method on a previously published work. Copyright © 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.|
|Source Title:||Proceedings of the National Conference on Artificial Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.