Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient solutions for mastermind using genetic algorithms

From MaRDI portal
Publication:1000972
Jump to:navigation, search

DOI10.1016/j.cor.2008.06.004zbMath1179.68115OpenAlexW2053820855MaRDI QIDQ1000972

Lotte Berghman, Roel Leus, Dries R. Goossens

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.004


zbMATH Keywords

genetic algorithmsgamesmastermind


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05)


Related Items (3)

On the query complexity of black-peg AB-mastermind ⋮ Guessing bank PINs by winning a mastermind game ⋮ Tactile Tools for Teaching: Implementing Knuth's Algorithm for Mastering Mastermind



Cites Work

  • Strategy optimization for deductive games
  • Some strategies for mastermind
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Efficient solutions for mastermind using genetic algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1000972&oldid=12995687"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 21:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki