Where is it?

This is a game to train logical thinking in children.

Rules

• Hidden in a randomly selected square is a red or "hot" square. The child's goal is to find it.
• If the child selects a cell that is touching the "hot" square, the square turns orange.
• If the child selects a cell that is in the row or column of the "hot" square, the square turns yellow.
• Otherwise, the square turns black.

The games keeps track of the number of turns that the child has taken. It also resets to another randomly selected hot square.

Example:

Assignment

• Use frames and multiple objects to implement the user interface of this game.
• Your game should keep score and reset.
• A Button Array is recommended. Paste the pieces you need into PartA.
• Draw a UML for your new program.
• Properly comment the code and submit it electronically.

Hints

• Use FrameSample and PartA (or the example code that we wrote in class) to get started. The FrameSample class will hold the title, a game object and the buttons at the very bottom - reset, creator, rules. The PartA (or game object) will hold the button array and all of the scoring information.
• Set up the basic Frame and Game first.
• Paste in the button array code. Make sure it is put into a grid layout.
• Add in titles and buttons.
• Code the buttons so that the rules pop up.
• Set up colours and graphics.
• In the game function, create a global variable x and y to hold the position of the secret square. Randomize it in the constructor.
• In the game function, test if the position clicked is close to x, y.

int pos = Integer.parseInt (e.getActionCommand ());
int i = pos / row;
int j = pos % row;
if (i == x && j == y)
a [pos].setBackground (Color.red);
else if (i + 1 == x && j + 1 == y)
a [pos].setBackground (Color.orange);

• In the game function make a message to show how close you are to the position. (This is added to the previous code)

if (i == spotx && j == spoty)
{
a [pos].setBackground (Color.red);
message.setText ("You found it!");
}

• Set up the score.
• Set up reset.