scientific article; zbMATH DE number 2040686

MaRDI QIDQ4449752zbMATH OpenFDO

Authors Tom Kalisker, Doug Camens

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241590.htm

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) Computing methodologies and applications (68U99)

Recommendations

• Efficient solutions for mastermind using genetic algorithms
• Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms
• On the algorithmic complexity of the Mastermind game with black-peg results

Cited in

(7)

• Guessing bank PINs by winning a mastermind game
• The number of pessimistic guesses in Generalized Mastermind
• On the query complexity of black-peg AB-mastermind
• The number of pessimistic guesses in generalized black-peg mastermind
• Efficient solutions for mastermind using genetic algorithms
• Strategy optimization for deductive games
• A genetic algorithm for the zen puzzle garden game

This page was built for publication:

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