# Let M And N Be Positive Integers And Consider The Following Game Called Pebble Up Pl 2942147

Let m and n be positive integers and consider the following game – called Pebble Up – played on an n × n grid. We will denote the square in the ith row of the grid and the jth column of the grid by the pair (i, j). For each 1 = i, j = n, the square (i, j) will be given a colour (either black or white) and a number (some positive integer k = m). The grid, along with a given colour and integer for each square, will be referred to as a game board. Pebble Up is played on the game board as follows. You have a bag of black and white pebbles, and for each integer k between 1 and m, you must choose to place either a black or a white pebble on all of the squares labelled with the integer k (so, squares with different numbers can have different coloured pebbles, but if two squares have the same number then they must have the same coloured pebble). After choosing a coloured pebble for each integer k, the game moves on to the next phase. For each square (i, j), with 1 = i, j = n – 1, examine the set of four squares Sij = {(i, j),(i + 1, j),(i, j + 1),(i + 1, j + 1)} . This set of four squares is said to be winning if at least one of squares has the same colour as the pebble lying on it. You win the game if every set Sij is winning. Figure 1 depicts a game board (with n = 3, m = 5) along with two configurations of pebbles. The middle configuration is a winning configuration: any set Sij of four squares has at least one pebble which has the same colour as its square. If we switch the colour of the “5” pebble from white to black, we get the configuration on the right. This is not a winning configuration since the set S12, consisting of the four squares in the top-right corner of the game board, has each square and pebble differing in colour. Here is the game formalized as language.

Attachments:

final.pdf