Implementation and analysis of Monte Carlo Tree Search and Minimax algorithm for computer to play Dots and Boxes

Authors

  • Mr.Charan Pote Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India
  • Mr.Sagar Singh Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India
  • Mr.Dhruv Shende Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India
  • Mr.Sahil Bhonde Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India
  • Mr.Ritik Satokar Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India
  • Mr.Tanmay Tarte Professor of Computer Technology Priyadarshini College of Engineering Nagpur, India

Keywords:

Monte-Carlo Tree Search, Mini-Max Algorithm, Alpha-Beta, algorithm

Abstract

Implementation and analysis of Monte Carlo Tree Search and Minimax algorithm for computers to play Dots and Boxes is the online version of the pen and paper game, Dots and Boxes which is the most widely played game. We have made the Dots and Boxes game Convenient, Fast to Play, & of course pleasing to the eye (with our UI). The Rules of the game are simple: Players take turns joining two horizontally or vertically adjacent dots by a line. A player/Computer that completes the fourth side of a square (a box) colours that box and must play again. When all boxes have been colored, the game ends, and the player/Computer who has colored more boxes wins. Easy Right? Well not that easy when you play, it challenges your critical thinking as the game progresses. Keeping that in mind we also have scores counted by computer and shown as the boxes get colored to make sure the player knows. We have used Artificial Intelligence Algorithms Monte Carlo Tree Search for searching the game tree. Monte-Carlo Tree Search (MCTS) and other algorithms like MiniMax or Alpha-Beta pruning are used to play against human players and also against themselves, The process of Monte Carlo Tree Search can be broken down into four distinct steps, i.e. selection, expansion, simulation, and backpropagation. Minimax algorithm plays a critical role in selecting moves that will try to find moves that give fewer points to the opponent and more to the computer making it tough on an opponent.

References

Solving Dots and Boxes. Barker, Joseph K, and Korf, Richard E. 2012, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Vol. 26, pp. 420-426.

Chapter 16: Dots and Boxes. Berlekamp, Elwyn R, Conway, John H and Guy, Richard K. 2, s.l. :Academic Press, 1982, Winning ways for your Mathematical plays, Volume 3, Vol. 3, pp. 507-550.

Improving Monte Carlo Tree Search With Artificial Neural Networks without Heuristics. Cotarelo,Alba, et al. 5, 2021, Applied Sciences, Vol. 11, p. 2056.

Haran, Brady and Berlekamp, Elwyn. How to always win at Dots and Boxes -Numberphile.

YouTube. [Online] 12 January 2015. https://www.youtube.com/watch?v=KboGyIilP6k.

Wilson, David. Dots-And-Boxes Analysis Results. [Online] [Cited: 01 04 2021.]

https://wilson.engr.wisc.edu/boxes/results.shtml.

Mastering the game of Go with deep neural networks and tree search. Silver, David, et al. 2016, Nature, Vol. 529, pp. 484-489.

Champandard, Alex J. AiGameDev. [Online] 12 August 2014. [Cited: 14 April 2021.]

https://web.archive.org/web/20170313041719/http://aigamedev.com/open/coverage/mcts-romeii/.

Monte Carlo Methods. Johansen, A.M. 2012, International Encyclopaedia of Education (Third Edition), pp. 296-303.

Downloads

Published

18-04-2022

How to Cite

Mr.Charan Pote, Mr.Sagar Singh, Mr.Dhruv Shende, Mr.Sahil Bhonde, Mr.Ritik Satokar, & Mr.Tanmay Tarte. (2022). Implementation and analysis of Monte Carlo Tree Search and Minimax algorithm for computer to play Dots and Boxes. International Journal for Research Publication and Seminar, 13(3), 12–17. Retrieved from https://jrps.shodhsagar.com/index.php/j/article/view/516

Issue

Section

Original Research Article