Printable View
I need extrem and urgent help: I currently developing a scrabble game in prolog, and I need to make the computer play, but I'm completly lost! Don't have the smallest clue how to analyse the board and find a play. This is for a work assignemt to be presented tomorrow, monday, and I'm desperate for help. So I'd like you to post here link to websites where I can find info on these algorithms. Thankx on advance ;)
EDIT: algorithms to analyse the board and determine valid plays.
Your work is requiring you to present a scrabble program?
I don't mean to call you a liar, but you're a liar.
I would have thought a bigger problem would be getting a list of all valid words.
Liar why??
The UI is implemented, so as predicats to verify valid plays, a dictionary of about 25k words. Now the big objective of this crap, using by logic methods (prolog, duh!!), is to make the computer play the damn game.
Oh.. and yes It's homework, but I'm not asking anyone for any source.. Only directions for algorithms.. thank you by your consideration.
Because in the span of two posts you completely changed your story.Quote:
Liar why??
Quote:
This is for a work assignemt
Oh and in response toQuote:
Oh.. and yes It's homework
Failure to prepare on your part doesn't constute an emergency on my part.Quote:
to be presented tomorrow
And again you posted the question on the wrong freaking board!
Huh! Sorry, may C board is nice for prolog questions...
> I need extrem and urgent help
http://www.catb.org/~esr/faqs/smart-...ns.html#urgent
> Don't have the smallest clue how to analyse the board and find a play.
Lets see, there's
- the set of possible moves
- the set of valid moves (intersects one or more letters already on the board?)
- the set of all possible words (eg hygmpf)
- the set of words in the dictionary (eg hello)
For all the valid words which are valid plays, find the one with the highest score.
> may C board is nice for prolog questions
Nope - that's what the tech board is for
Which is where this thread now is
Well, I admit I've explained my situation in a wrong way.
The game's interface is up and running. The board and a set of functions relative to it are also implemented.
The problem is to find valid plays.
I already have predicates to determine all possible words in the dictionary that can be written with the set of pieces each player has. Then after finding all possible plays choosing the best is very trivial.
I'd asked you to place here some links where I can find valid info on algorithms.
And Thantos, it's your decision to help or not. Am I forcing you to anything?
I'm helping by keeping you honest and letting you know when you screw up.
The underlying logic is fairly simple (at least for a simple algorithm):
- you know (or can find) the set of intersections (that is, the set of possible continuations on the board)
-- e.g. ???a??? (where ? is a variable letter) is the 7-letter string with a in the middle (obviously, the case of running a word parallel to another requires some care)
- you can find the elements in the dictionary that match the patterns you found in the previous step (this could be rather time consuming with a large dictionary)
- find the intersection of the above set with the set of words that can be made from the players letters (taking into account the fact that the matched letters are already on the board
It may be a bit time consuming to implement this, though (as would probably any solution)
i though about that, but then I would have for each space in the board to search vertically and horizontaly for matches from size 2 to (what?) 15. time consuming indeed...
>time consuming indeed...
That's why creating a good algorithm is key to any good program.\
GLHF
OH, by the way, try google some time.
http://www.cs.ubc.ca/local/reading/p...ue2/spe880.pdf
Thank you!
GFG number one result in googling monopoly algorithm is what helped you.
WHY DONT PEOPLE USE GOOGLE BEFORE THEY POST. W_O_W (no not world of warcraft)