University of Alberta A New Paradigm for Minimax Search

First Page		Document Content
Date: 2013-01-12 16:42:41 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 Source URL: askeplaat.files.wordpress.com Download Document from Source Website File Size: 432,11 KB Share Document on Facebook

	An Algorithm Faster than NegaScout and SSS* in Practice Aske Plaat, Erasmus University, Jonathan Schaeffer, University of Alberta, Wim Pijls, Erasmus University, .e DocID: 1tHuk - View Document
	RankCut — A Domain Independent Forward Pruning Method for Games DocID: 183Me - View Document
	Best-First Fixed-Depth Minimax Algorithms Aske Plaat, Erasmus University, [removed] Jonathan Schaeffer, University of Alberta, [removed] Wim Pijls, Erasmus University, [removed] Ari DocID: RQhe - View Document
	Verified Null-Move Pruning 153 VERIFIED NULL-MOVE PRUNING Omid David Tabibi 1 DocID: kheO - View Document
	RESEARCH RE: SEARCH & RE-SEARCH DocID: 4sbr - View Document