Applying genetic algorithms to game search trees

DOI10.1007/S005000100154MaRDI QIDQ1864475zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 March 2003

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s005000100154

zbMATH Keywords

computer gamegame tree searches

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• A genetic algorithm for the zen puzzle garden game
• A general framework for minimax search in game trees
• scientific article; zbMATH DE number 269837
• Optimal Search on Some Game Trees
• scientific article; zbMATH DE number 1759682

Cited in

(9)

• A genetic algorithm for the zen puzzle garden game
• Genetically modified games
• A parallel solution to the HIP game based on genetic algorithms
• Optimization and design of connect 6 heuristic searching algorithm
• AWT: Aspiration with Timer Search Algorithm in Siguo
• scientific article; zbMATH DE number 1759682 (Why is no real title available?)
• Genetically modified games
• Win-win match using a genetic algorithm
• Zen puzzle garden is NP-complete

This page was built for publication: Applying genetic algorithms to game search trees

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