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?

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:

Really cool scrabble:

Similar problem:

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

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.