IMPLEMENTASI ALGORITMA NEGASCOUT PADA PERMAINAN NINE MEN’S MORRIS

Dany Kurniawan, Rosa Delima, Nugroho Agus Haryono

Abstract


Application development nowadays many are using technology/knowledge of Artificial Intelligence study. This research tries to make an intelligence agent that can play Nine Men’s Morris game using Negascout algorithm. The purpose of this research are to compare the effectiveness of Negascout algorithm in exploring the best move along with time that required, compared with Alpha-Beta Pruning algorithm.  The result from this research are Negascout algorithm explores fewer nodes and require less time in the search of the best move compared with Alpha-Beta Pruning algorithm.

Keywords


artificial intelligence, Negascout, Nine Men’s Morris

Full Text:

PDF

References


Boyd, M., & Hirunthanakorn, C. (2012). Analyzing Nine Men's Morris For a Optimal Strategy. 1-7.

Gasser, R. (1996). Solving Nine Men's Morris. MSRI , 101-113.

Millington, I., & Funge, J. (2009). Artificial Intellegence for Games Second Edition. Burlington: Morgan Kaufmann.

Petcu, S.-A., & Holban, S. (2008). Nine Men's Morris: Evaluation Functions. International Conferencs on Development and Application Systems , 89-92.

Reinefeld, A. (1983). An Improvement to The Scout Tree Search Algorithm . International Computer Chess Association , 4-14.

Russel, S. J., & Norvig, P. (2003). Artificial Intelligece : A Modern Approach Second Edition. New Jersey: Prentice Hall.




DOI: http://dx.doi.org/10.21460/inf.2015.111.419

Refbacks

  • There are currently no refbacks.


Bookmark and Share