{"id":{"repo_id":"rowan","oai_identifier":"oai:rdw.rowan.edu:etd-3362"},"canonical_url":"https://search.ndltd.org/etd/rowan/oai:rdw.rowan.edu:etd-3362","repository":{"repo_id":"rowan","name":"Rowan University","base_url":"https://rdw.rowan.edu/do/oai/"},"display":{"title":"Exploring algorithms to recognize similar board states in Arimaa","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.","abstract_html":"The game of Arimaa was invented as a challenge to the field of game-playing artificial intelligence, which had grown somewhat haughty after IBM&#x27;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&#x27;s best human Arimaa players, mainly due to the game&#x27;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.","abstract_has_math":false,"creators":["Ahmed, Malik Khaleeque"],"institution":null,"degree_name":"MS Computer Science","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Tinkham, Nancy L.","Hnatyshin, Vasil Y.","Hristescu, Gabriela"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:58:38Z","subjects":["AI","Arimaa","Artificial Intelligence","board games","Game-playing AI","Artificial intelligence--Computer programs","Artificial Intelligence and Robotics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://rdw.rowan.edu/etd/2360","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://rdw.rowan.edu/etd/2360","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://rdw.rowan.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ardw.rowan.edu%3Aetd-3362","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Tinkham, Nancy L.","Hnatyshin, Vasil Y.","Hristescu, Gabriela"]},{"key":"dc:creator","label":"Author","values":["Ahmed, Malik Khaleeque"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-02-15T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2017-02-14T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["AI","Arimaa","Artificial Intelligence","board games","Game-playing AI","Artificial intelligence--Computer programs","Artificial Intelligence and Robotics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://rdw.rowan.edu/etd/2360"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Exploring algorithms to recognize similar board states in Arimaa"]}]}],"canonical_facts":{"dc:contributor":["Tinkham, Nancy L.","Hnatyshin, Vasil Y.","Hristescu, Gabriela"],"dc:creator":["Ahmed, Malik Khaleeque"],"dc:date.available":["2017-02-15T08:00:00Z"],"dc:date.created":["2017-02-14T08:00:00Z"],"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."],"dc:identifier":["https://rdw.rowan.edu/etd/2360"],"dc:subject":["AI","Arimaa","Artificial Intelligence","board games","Game-playing AI","Artificial intelligence--Computer programs","Artificial Intelligence and Robotics"],"dc:title":["Exploring algorithms to recognize similar board states in Arimaa"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["MS Computer Science"]},"updated_at":"2026-11-19T08:58:38Z"}