Pages that link to "Item:Q286381"
From MaRDI portal
The following pages link to Algorithms for computing strategies in two-player simultaneous move games (Q286381):
Displaying 5 items.
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games (Q2303656) (← links)
- Computer solution to the game of pure strategy (Q2345029) (← links)
- Asymmetric Action Abstractions for Planning in Real-Time Strategy Games (Q5870509) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)