On the Complexity of Reconnaissance Blind Chess. (arXiv:1811.03119v1 [cs.AI])

This paper provides a complexity analysis for the game of reconnaissance
blind chess (RBC), a recently-introduced variant of chess where each player
does not know the positions of the opponent’s pieces a priori but may reveal a
subset of them through chosen, private sensing actions. In contrast to commonly
studied imperfect information games like poker and Kriegspiel, an RBC player
does not know what the opponent knows or has chosen to learn, exponentially
expanding the size of the game’s information sets (i.e., the number of possible
game states that are consistent with what a player has observed). Effective RBC
sensing and moving strategies must account for the uncertainty of both players,
an essential element of many real-world decision-making problems. Here we
evaluate RBC from a game theoretic perspective, tracking the proliferation of
information sets from the perspective of selected canonical bot players in
tournament play. We show that, even for effective sensing strategies, the game
sizes of RBC compare to those of Go while the average size of a player’s
information set throughout an RBC game is much greater than that of a player in
Heads-up Limit Hold ‘Em. We compare these measures of complexity among
different playing algorithms and provide cursory assessments of the various
sensing and moving strategies.

Source link

Related posts

There’s a scarily good ‘deepfakes’ YouTube channel that’s quietly growing – and it’s freaking everyone out


US military chucks $2bn at AI, Google touts machine-learning data search, and more


Machine learning professor missing after avalanche disaster in the Himalayas – Tech in Asia


This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy


COVID-19 (Coronavirus) is a new illness that is having a major effect on all businesses globally LIVE COVID-19 STATISTICS FOR World