Back to search

Rowan University

Exploring algorithms to recognize similar board states in Arimaa

Abstract

dc:description.abstract

The game of Arimaa was invented as a challenge to the field of game-playing artificial intelligence, which had grown somewhat haughty after IBM's supercomputer Deep Blue trounced world champion Kasparov at chess. Although Arimaa is simple enough for a child to learn and can be played with an ordinary chess set, existing game-playing algorithms and techniques have had a difficult time rising up to the challenge of defeating the world's best human Arimaa players, mainly due to the game's impressive branching factor. This thesis introduces and analyzes new algorithms and techniques that attempt to recognize similar board states based on relative piece strength in a concentrated area of the board. Using this data, game-playing programs would be able to recognize patterns in order to discern tactics and moves that could lead to victory or defeat in similar situations based on prior experience.

Degree

thesis:*
Name thesis:degree_name
MS Computer Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ahmed, Malik Khaleeque
Contributors dc:contributor
  • Tinkham, Nancy L.
  • Hnatyshin, Vasil Y.
  • Hristescu, Gabriela

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://rdw.rowan.edu/etd/2360

Chain of custody

source
Harvested from
Rowan University
Base URL
rdw.rowan.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ahmed, Malik Khaleeque. Exploring algorithms to recognize similar board states in Arimaa. Thesis thesis, https://rdw.rowan.edu/etd/2360