Tuning evaluation functions by maximizing concordance

DOI10.1016/J.TCS.2005.09.047MaRDI QIDQ817798zbMATH OpenOpenAlexFDO

Authors D. Gomboc, T. A. Marsland, Michael Buro

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.09.047

zbMATH Keywords

computer chessgradient ascentheuristic evaluation functionheuristic searchKendall's \(\tau \)ordinal correlationpartial-sum transform

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Game theory (91A99)

Recommendations

• Large-Scale Optimization for Evaluation Functions with Minimax Search
• Heuristic function evaluation framework
• Improving heuristic mini-max search by supervised learning
• A pattern classification approach to evaluation function learning
• Bias and pathology in minimax search

Cites work

• Best-first fixed-depth minimax algorithms
• scientific article; zbMATH DE number 48544 (Why is no real title available?)
• scientific article; zbMATH DE number 1966230 (Why is no real title available?)
• scientific article; zbMATH DE number 236854 (Why is no real title available?)
• scientific article; zbMATH DE number 3063363 (Why is no real title available?)
• Many-Layered Learning
• On the Theory of Scales of Measurement
• Tuning evaluation functions by maximizing concordance

Cited in

(4)

• Computer chess move-ordering schemes using move influence
• Heuristic function evaluation framework
• AN IMPROVER OF CHESS PROBLEMS
• Tuning evaluation functions by maximizing concordance

This page was built for publication: Tuning evaluation functions by maximizing concordance

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