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

Re^2: Challenge: Designing A Computer Opponent

by Limbic~Region (Chancellor)
on Dec 13, 2007 at 03:29 UTC ( #656744=note: print w/replies, xml ) Need Help??


in reply to Re: Challenge: Designing A Computer Opponent
in thread Challenge: Designing A Computer Opponent

Hercynium,
Do you use a dictionary of words that the computer opponent uses to find words to guess? If so, you could simply generate different dictionaries for different difficulty levels.

Yes. As I indicated in my original post, known vocabulary is one of the factors that can be used for a configurable difficulty level. The problem is finding the right balance.

Also, the type of analysis required to solve the problem lends itself well to recursive solutions... perhaps build-in a (configurable) limit to how deep the analysis goes?

I am not sure how to apply this. My current expert solution is not recursive and I am not sure how I could stop it midstream. Did you have an implementation in mind?

If all else fails, or isn't enough, I am partial to my earlier suggestion - make the computer make mistakes! Randomly inject bad data into the algorithm in the form of bad or mis-spelled dictionary entries, randomly delete previously-guessed entries, etc...

As I indicated in my post, mistakes are factors that can be used in the difficulty factor. The problem is an actual implementation that results in a realistic player and not something too easy or too hard.

Cheers - L~R

  • Comment on Re^2: 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://656744]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2023-01-28 17:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?