Skip to content
Oviatt Library

Oviatt Library Catalog

 
     
Author Gulati, Pallavi, author.
Title Implementing game-tree searching strategies to the game of Hasami Shogi / by Pallavi Gulati.
Published [Northridge, California] : California State University, Northridge, 2012.
LOCATION CALL # STATUS
 Electronic Book  QA76 .Z95 2012 G85eb    ONLINE
  
Description 1 online resource (vii, 66 pages) : illustrations, charts, some color.
Content Type text
still image
Format online resource
File Characteristics text file PDF
Thesis M.S. California State University, Northridge 2012.
Bibliography Includes bibliographical references (pages 28-29).
Summary The main purpose of this project was to understand how the various gaming algorithms apply to the game of Hasami Shogi. The game of Hasami Shogi posed its own challenges as the number of possible moves from any particular state of the board is quite large. Different algorithms like Mini-Max, Alpha-Beta, Monte-Carlo Tree Search were implemented and tried out. Monte Carlo Tree Search with UCT method seemed to be more effective than the others though not very significantly. The UCT value needed to be optimized for the game and also some evaluation mechanisms needed to be put in place so that the program would concentrate on a particular promising part of the game-tree instead of wasting time evaluating moves which cannot lead to a winning scenario. The program provides an option to select different algorithms for both players and a comparison study was made. The results of all these games have been published as part of the thesis.
Note Description based on online resource; title from PDF title page (viewed on January 18, 2013).
Subject Games of strategy (Mathematics)
Programming (Mathematics)
Local Subject Dissertations, Academic -- CSUN -- Computer Science.
OCLC number 850963124