CHESS -PLAYING PROGRAMS AND THE PROBLEM OF COMPLEXITY

First Page		Document Content
Date: 2012-05-11 10:21:48 Gaming Game artificial intelligence Abstract strategy games Chess variants Outline of chess Minimax Evaluation function Rules of chess Endgame tablebase Games Chess Computer chess		CHESS -PLAYING PROGRAMS AND THE PROBLEM OF COMPLEXITY Add to Reading List Source URL: aitopics.org Download Document from Source Website File Size: 2,12 MB 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