Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Challenge: Designing A Computer Opponent

by eric256 (Parson)
on Dec 13, 2007 at 03:29 UTC ( [id://656743]=note: print w/replies, xml ) Need Help??


in reply to Challenge: Designing A Computer Opponent

Hey,

I would think that you build a guess() function that scans a dictionary and removes all the impossible words. Then sorts those words based on use frequency. Then your different degrees of difficulty could control where you pick words from the list. Most difficult would only pick the very best words, and the lower the difficult the lower down the list the computer picks from.

A smarter AI might also be able to use its first few guesses to get a better idea what letters are in the word, i'm not sure how this could be done but i would guess that good players would be able to work the system to get more info out of it (like when you play mastermind).

If you already have code for score() that would be nice to see ;)


___________
Eric Hodges
  • Comment on Re: Challenge: Designing A Computer Opponent

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://656743]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others meditating upon the Monastery: (2)
As of 2024-04-26 02:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found