Improving heuristic mini-max search by supervised learning

DOI10.1016/S0004-3702(01)00093-5MaRDI QIDQ5958202zbMATH OpenFDO

Authors Michael Buro

Publication date 3 March 2002

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(01)00093-5

zbMATH Keywords

feature constructionevaluation functionGLEMLogistelloopening book learningProbCutselective game-tree search

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 269837
• Large-Scale Optimization for Evaluation Functions with Minimax Search
• Best-first minimax search
• Game tree searching by min/max approximation
• scientific article; zbMATH DE number 895355

Cites work

• scientific article; zbMATH DE number 43243 (Why is no real title available?)
• A Bayesian approach to relevance in game playing
• A world-championship-level Othello program
• Conspiracy numbers for min-max search
• Game tree searching by min/max approximation
• Genetic programming III. Darwinian invention and problem solving

Cited in

(6)

• ENHANCED REALIZATION PROBABILITY SEARCH
• Optimization and design of connect 6 heuristic searching algorithm
• SELF-PLAYING-BASED OPENING BOOK TUNING
• Automatic generation of opening books for dark chess
• scientific article; zbMATH DE number 1708073 (Why is no real title available?)
• Tuning evaluation functions by maximizing concordance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958202)