Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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


Comment on Re: Words With Friends Algorithm

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2014-10-24 11:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (131 votes), past polls