no code implementations • 19 Apr 2024 • Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant, Michael Buro
Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large.
no code implementations • 27 May 2019 • Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant
Trick-taking card games feature a large amount of private information that slowly gets revealed through a long sequence of actions.
no code implementations • 27 May 2019 • Douglas Rebstock, Christopher Solinas, Michael Buro
In trick-taking card games like Bridge or Skat, large information sets and an inability to advance the simulation without fully determinizing the state make forward search problematic.
no code implementations • 22 Mar 2019 • Christopher Solinas, Douglas Rebstock, Michael Buro
In trick-taking card games, a two-step process of state sampling and evaluation is widely used to approximate move values.