Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?

Re: Words With Friends Algorithm

by ColonelPanic (Friar)
on Nov 13, 2012 at 13:49 UTC ( #1003612=note: print w/replies, xml ) Need Help??

in reply to Words With Friends Algorithm

This is a significant AI problem. The generic solution would be running simulated future game outcomes for each potential move to see which one maximizes your probable point advantage. However, this will get expensive very quickly--each move involves scanning thousands of possible word/location combinations, and your opponents' tiles are not known. It would get very interesting if you restrict the amount of time the player can run and the size of the code.

My suggestions:

  • Think hard about a good set of rules. To keep this fun, you want to require the players to be fairly simple, and you don't want the games to take forever.
  • To start out, just make a game module and post it here, along with a simplistic player that will give people a test opponent. Then people can download it and run it themselves with different players. If the idea draws interest, you can set up something more complex, like a web interface.

  • When's the last time you used duct tape on a duct? --Larry Wall

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1003612]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2018-06-23 11:07 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (125 votes). Check out past polls.