#### Filter Results:

#### Publication Year

2010

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This paper proposes a simple extension of the celebrated MINIMAX algorithm used in zero-sum two-player games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortest-path framework is applied for biasing the artificial intelligence… (More)

- Silvia Garćıa Dı́ez, Jérôme Laforge, Marco Saerens
- 2010

This short paper proposes a simple extension of the celebrated MINIMAX algorithm used in zero-sum two-player games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortest-path framework (Saerens et al., 2009) is applied for biasing… (More)

- ‹
- 1
- ›