Effect of look-ahead depth in evolutionary checkers
DOI10.1007/S11390-012-1280-6zbMATH Open1279.68300OpenAlexW2084417189WikidataQ59569442 ScholiaQ59569442MaRDI QIDQ389031FDOQ389031
Authors: Belal Al-Khateeb, Graham Kendall
Publication date: 17 January 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-012-1280-6
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Introduction to evolutionary computing
- Title not available (Why is that?)
- Checkers is solved
- Deep Blue
- Title not available (Why is that?)
- Evolutionary computation: a unified approach.
- Title not available (Why is that?)
- Title not available (Why is that?)
- One Jump Ahead
- AI 2003: Advances in Artificial Intelligence
- Verifying Anaconda's expert rating by competing against Chinook: Experiments in co-evolving a neural checkers player
- The effect of mobility on minimaxing of game trees with random leaf values
- When is it better not to look ahead?
Cited In (1)
This page was built for publication: Effect of look-ahead depth in evolutionary checkers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389031)