Pages that link to "Item:Q2726291"
From MaRDI portal
The following pages link to GIB: Imperfect information in a computationally challenging game (Q2726291):
Displaying 17 items.
- GIB (Q13840) (← links)
- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information (Q464622) (← links)
- A circumscriptive theorem prover (Q1123640) (← links)
- Search in games with incomplete information: a case study using Bridge card play (Q1128766) (← links)
- Games, computers, and artificial intelligence (Q1603559) (← links)
- A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189) (← links)
- Learning to bid in bridge (Q2433171) (← links)
- An Analysis of UCT in Multi-player Games (Q3601819) (← links)
- AWT: Aspiration with Timer Search Algorithm in Siguo (Q3601838) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666256) (← links)
- On Monte-Carlo tree search for deterministic games with alternate moves and complete information (Q4967797) (← links)
- (Q5194227) (← links)
- A reinforcement learning scheme for a partially-observable multi-agent game (Q5916201) (← links)
- A reinforcement learning scheme for a partially-observable multi-agent game (Q5921684) (← links)
- The challenge of poker (Q5958207) (← links)
- World-championship-caliber Scrabble* (Q5958208) (← links)
- On the computational complexity of bridgecard (Q5963617) (← links)