Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary

First Page		Document Content
Date: 2009-04-20 18:54:11 Search algorithms Game artificial intelligence Combinatorial optimization Routing algorithms Data types Minimax A* search algorithm Monte Carlo method Tree traversal UCT Tree Monte Carlo tree search		Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary Add to Reading List Source URL: ggp.stanford.edu Download Document from Source Website File Size: 327,68 KB Share Document on Facebook

	Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International DocID: 1vqMk - View Document
	2015 European Control Conference (ECC) July 15-17, 2015. Linz, Austria Approximate Closed-Loop Minimax Model Predictive Operation Control of Microgrids Christian A. Hans, Vladislav Nenchev, J¨org Raisch and Carsten Rein DocID: 1uMON - View Document
	Minimax Theory and its Applications Volume), No. 2, 265–283 Bounded Solutions to Nonlinear Problems in RN Involving the Fractional Laplacian Depending on Parameters DocID: 1unZ8 - View Document
	Online Convex Optimization: From Gambling to Minimax Theorems by Playing Repeated Games Tim van Erven DocID: 1u2Qx - View Document
	CS364A: Algorithmic Game Theory Lecture #18: From External Regret to Swap Regret and the Minimax Theorem∗ Tim Roughgarden† November 20, 2013 DocID: 1tNkR - View Document