0

hey,

wanted to know if anyone knew how we would use a 'directed acyclic word graph' (dawg) to generate a computer players move in scrabble. Know of any algorithms, have you got any code snippets i can see?

2
Contributors
3
Replies
4
Views
12 Years
Discussion Span
Last Post by server_crash
0

Since it involves nodes, then you could probably use a binary search tree. If you know how the algorithm works and everything you might not have too many problems, but this program will still be very tuff.

If I had further advice/code snippets/suggestions I would give them to you, but I don't.

In the meantime, here's a few links that might help:

What Dawg is:
http://www.google.com/search?client=firefox-a&rls=org.mozilla%3Aen-US%3Aofficial_s&hl=de&q=directed+acyclic+word+graph&lr=&btnG=Google-Suche

Really cool scrabble:
http://javaboutique.internet.com/scrabblegame/

Similar problem:
http://forum.java.sun.com/thread.jspa?forumID=426&threadID=316951

0

do you think i could use a hash map to code something like this or is that an inefficient way of going about it

0

Well, it depends on how you would use it. If you could find a good way to implement it, then I would go for it. HashMaps use values and keys assosiated with those values. So you would need to have something for the values and something for the keys.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.