KEMBAR78
2.2.3 Game Points | PDF | Applied Mathematics | Theoretical Computer Science
Scribd
Upload
41 views2 pages

2.2.3 Game Points

The document describes the rules and gameplay of Scrabble. It explains that players are assigned 7 tiles each and take turns placing words on a board by connecting to existing words. The word must be in the dictionary to score points based on the letters. An "anchor point" is where a word is first placed on the board, and subsequent words must connect to existing words. The computer player aims to form the highest scoring words possible by searching the board and considering available anchor points and crossword opportunities.

Uploaded by

Bakhtiyar Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views2 pages

2.2.3 Game Points

The document describes the rules and gameplay of Scrabble. It explains that players are assigned 7 tiles each and take turns placing words on a board by connecting to existing words. The word must be in the dictionary to score points based on the letters. An "anchor point" is where a word is first placed on the board, and subsequent words must connect to existing words. The computer player aims to form the highest scoring words possible by searching the board and considering available anchor points and crossword opportunities.

Uploaded by

Bakhtiyar Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

2.2.

3 Game points
The player gains score to a word only if it is in the dictionary words. This score is generated only by
the sum of the scores of the letters in a word.

For example: TREASURE

In the above example the tile “T” consist of point 1, tile “R” consist of point 1, tile “E” consist of point
1, tile “A” consist of point 1, tile “S” consist of point 1, tile “U” consist of point 1, tile “R” consist of
point 1, tile “E” consist of point 1. By adding all the scores we will get a general word score as 8.

2.2.4 Game play


C

Initially when a Human-Computer game is started, the first playing chance always goes to human.
And on a Human-Human game, the chance of playing first can be selected randomly according to
the players wish. After the game is started, each player is assigned with 7 tiles each. The first player
will start the game, by placing a meaningful word at the centre of the board according to the
standard dictionary words. The word must go through the initial anchor point in the horizontal or
vertical direction.

The 2nd player will start the game, by checking the 1st player’s word at the anchor point and he can
place the word any where connecting the 1st player’s word. The game proceeds in this way and all
the words which are being placed (while playing) on the board acts as anchor points and thus the
game leads to an end by spreading all the words across the board connecting their anchor points.
The player should mainly consider the letters with high scores to form a word such that he can gain
more score from each word. Finally, the highest scorer is declared as a winner of the game.

Get Help With Your Example Literature Review


If you need assistance with writing your own example literature review, our professional example
literature review writing service is here to help!
Find out more
Every game is equipped with a dictionary to check correctness of a word which is being placed on
the board. Once the 1st player gets a score for the word he placed on the board, the opponent
player gets a chance to play the game only after the 1st player clicks the “pass” button and vice
versa.

2.3 Algorithms
The algorithms that are used in the scrabble game for computer player to play. If a computer must
play the scrabble game, it must search the whole board where the tiles are connected. After
searching the word on the board it must check the anchor points and the crosswords for the game.
Then the computer can place the word in left part of anchor point or right part of the word by
continuing the previously placed word. Each and every time the computer player wants to keep a
highest scoring word on the board by checking the anchor and crossword.

2.3.1 Anchor squares


A square is an anchor in the board, if it is empty and else if it is not empty, at least one adjacent non-
empty square should exist [5].

For example: HE

T {N, SE, M}

Anchor squares

In the above example the 1st player kept a word “HE” from his rack. After searching the word by the
computer, then started checking the anchor squares left and right of the word placed by the 1st
player to form a highest score from computer’s rack. The computer can place the words like THEN,
THESE and THEM.

You might also like