Sciweavers

20 search results - page 4 / 4
» Generalized Monte-Carlo Tree Search Extensions for General G...
Sort
View
AAAI
2012
11 years 7 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
AUSAI
2010
Springer
13 years 3 months ago
Pushing the Envelope: General Game Players Prove Theorems
A general game player is a system that can play previously unknown games given nothing but their rules. A key to success in this endeavour is the ability to automatically gain know...
Sebastian Haufe, Michael Thielscher
AAAI
2010
13 years 6 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
CIM
2011
171views Hardware» more  CIM 2011»
12 years 11 months ago
Towards Cognitively Plausible Game Playing Systems
We propose to return to the roots of Artificial/Computational Intelligence applicability to board games domain by attempting to mimic human way of playing (or human intelligence ...
Jacek Mandziuk
AI
2002
Springer
13 years 4 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro