Back to Results
First PageMeta Content
Artificial intelligence / Graph theory / MTD-f / Negascout / Minimax / Negamax / SSS* / Transposition table / Iterative deepening depth-first search / Search algorithms / Game artificial intelligence / Mathematics


University of Alberta A New Paradigm for Minimax Search
Add to Reading List

Document Date: 2013-01-12 16:42:41


Open Document

File Size: 432,11 KB

Share Result on Facebook

City

Phoenix / /

Country

Canada / /

/

Facility

University of Alberta A New Paradigm / The Netherlands University of Alberta / General Services Building / Erasmus University / University of Alberta / DEPARTMENT OF COMPUTING SCIENCE The University of Alberta Edmonton / /

IndustryTerm

minimax search algorithms / search assertion / wide search window / search trees / depth-first and best-first algorithms / search value / game-tree search algorithms / depth-first search / minimal search tree / so-called minimal search tree / search strategy / iterative deepening search / re-search trees / game-tree search / search tree / literature compare game-tree search algorithms / minimax game-tree search algorithms / depth-first algorithms / simpler algorithm / search bound / search results / fixed-depth search / search algorithms / be implemented using depth-first search / /

Organization

Department of Computer Science / Erasmus University / Department of Computing Science / University of Alberta / University of Alberta Edmonton / /

Person

Alberta Edmonton / Jonathan Schaeffer / /

Position

driver / /

ProgrammingLanguage

Pascal / /

ProvinceOrState

Montana / be created using MT / /

Technology

Alpha / basic Alpha-Beta algorithm / SSS* algorithm / literature compare game-tree search algorithms / Minimax-tree search algorithms / minimax search algorithms / Scout algorithm / artificial intelligence / MT-based algorithms / minimax game-tree search algorithms / simpler algorithm / game-tree search algorithms / Scout-based algorithms / /

SocialTag