|Keep It Simple, Stupid|
Challenge: Designing A Computer Opponentby Limbic~Region (Chancellor)
|on Dec 13, 2007 at 00:45 UTC||Need Help??|
Limbic~Region has asked for the wisdom of the Perl Monks concerning the following question:
I am writing a Lingo-ish game for my mother. One of the problems I am having is designing a computer opponent. The trouble is that I want the difficulty to be configurable. For those unfamiliar, here is a brief description of the game:
The game starts with a secret word of a fixed number of letters with only the first letter known. A player guesses a word. Provided the guessed word is within the rules, each letter falls into 1 of 3 categories:
While I am still working out the exact rules I intend to use, there are 4 types of guesses:
Some good guesses are better than other good guesses depending on how much new information they reveal. What I need help with is making a guessing algorithm that can be better or worse depending on configuration. Here are the factors that can go into making a guess:
Your challenge, if you choose to accept it, is to design an algorithm that can take the above factors into consideration to make a configurable computer opponent. While I would hope for something better than just "Easy, Medium, Hard", I will be very appreciative of anything I can get.
I have explained more about the game play here.
Cheers - L~R