Improving heuristic mini-max search by supervised learning

DOI10.1016/S0004-3702(01)00093-5zbMath0982.68123MaRDI QIDQ5958202

Michael Buro

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

evaluation functionfeature constructionGLEMLogistelloopening book learningProbCutselective game-tree search

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Game theory (91A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

SELF-PLAYING-BASED OPENING BOOK TUNING

Cites Work

• A world-championship-level Othello program
• Game tree searching by min/max approximation
• Conspiracy numbers for min-max search
• A Bayesian approach to relevance in game playing
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving heuristic mini-max search by supervised learning