Reply to: Scrabble Algorithm

[roger rabbit]

Hey MF, Marillion are still Sh...te.

How is the bamboo furniture business doing?

[Jabberwocky]

Ummm, no.

A loop is a sequence of statements which is specified once but which may be carried out several times in succession. The code "inside" the loop, the body of the loop, is obeyed a specified number of times, or once for each of a collection of items, or until some condition is met.

A recursive procedure is one that in order to be completed may call itself a number of times in order to calculate the final result, not nessecerily in strict succession. For example:

A procedure is recursive if one of the steps that makes up the procedure calls for a new running of the procedure. Therefore a recursive four course meal would be a meal in which one of the choices of appetizer, salad, entrée, or dessert was an entire meal in itself. So a recursive meal might be potato skins, baby greens salad, chicken parmesan, and for dessert, a four course meal, consisting of crab cakes, Caesar salad, for an entrée, a four course meal, and chocolate cake for dessert, so on until each of the meals within the meals is completed.

I know what recursion is diptulip. Recursion is looping since one can take the state with the function call through an argument. The function is the body of the loop.

[xoggoth]

Make sure you implement proper rules as played in our household. Rude words count double.

[_V_]

Scrabble algorithm.

Create game class
Create position/square class.
Create board class.
Create rules class.
Create score class.
Create tile(s) class.
Create player class.
Create turn class
Create words class
etc

I would use Backpropagation Neural Network to weight each of the 225 squares.

Given set of pieces (randomly picked) I would use classes to work out possible scores for legal positions within certain timeframes and weight scoring based on NN weights.

At end of game I would replay all moves into NN to adjust weights based on how good the move turned out to be. In this way, weights would adjust for strategically good positions such as edges and corners.

PS. Looks like someone has nicked my idea using a timemachine (Threaded?)

http://en.wikipedia.org/wiki/Maven_(Scrabble)

PPS. Why do you want to know about Scrabble? If you are thinking of releasing a Scrabble computer game think again. Hasbro/Mattel will sue the arse off you as they have done with every other non-official computer version.

[MarillionFan]

So, so far, no-one has a clue. Thats what your saying.

[DaveB]

Lack of variables (<xsl:variable> should have been called <xsl:constant>) is what really bugs me about XSLT.

My coding days are long gone, thankfully. Nowadays I have people to worry about these things for me

[AtW]

Lack of variables (<xsl:variable> should have been called <xsl:constant>) is what really bugs me about XSLT.

[DaveB]

Recursion is looping diptulip.

Ummm, no.

A loop is a sequence of statements which is specified once but which may be carried out several times in succession. The code "inside" the loop, the body of the loop, is obeyed a specified number of times, or once for each of a collection of items, or until some condition is met.

A recursive procedure is one that in order to be completed may call itself a number of times in order to calculate the final result, not nessecerily in strict succession. For example:

A procedure is recursive if one of the steps that makes up the procedure calls for a new running of the procedure. Therefore a recursive four course meal would be a meal in which one of the choices of appetizer, salad, entrée, or dessert was an entire meal in itself. So a recursive meal might be potato skins, baby greens salad, chicken parmesan, and for dessert, a four course meal, consisting of crab cakes, Caesar salad, for an entrée, a four course meal, and chocolate cake for dessert, so on until each of the meals within the meals is completed.

[Jabberwocky]

None of which are present in XSLT...

Recursion is looping diptulip.

[AtW]

Just don't use Crystal Reports for it MF, you won't be able to bluff your way thorugh this one...

[DaveB]

What does the panel reckon the logic behind it is?

OK. Got a dictionary. OK got a board.

What is the word placing logic?

The basics are to get the highest value word possible from the available letters and place them on the highest scoring squares.

You also need to be able to take into account the available letters on the board and the combinations available with the letters in in hand. This needs to include the available space on the board as well as the letters that can be used.

In theory it should be relatively straightforward, you have a fixed range of parameters to consider, a fixed gamespace to work in and well defined rules for what does and doesnt work within the game rules.

The trick to actually playing well is not just to get the highest score possible from each word but to prevent your opponent scoreing as well. Since you dont know what letters they have this comes down to preventing them using the score multipliers on the board through tactical placement of yur own words. That could be the tricky bit if you are after a really effective computer player.

[Emperor Dalek]

I implemented it on TI-85 while at school using big Oxford dictionary, I then played all crosswords and games in existance to make my first million that I spend buying parts for my future (if you look at it from the point of time in the past) time machine.

threaded.

[AtW]

The algorithm is not important, what's important are variables, loops and registers.

None of which are present in XSLT...

[AtW]

I implemented it on TI-85 while at school using big Oxford dictionary, I then played all crosswords and games in existance to make my first million that I spend buying parts for my future (if you look at it from the point of time in the past) time machine.

threaded.

[DimPrawn]

AtW would recommend XSLT to implement your logic or failing that, assembly language.

The algorithm is not important, what's important are variables, loops and registers.

HTH