It's important to note that a valid game evolves around one start position. A board doesn't contain more than one set of tiles. There are 36 different types of stones, each 3 times, makes a total of 108 tiles. On every field on the board can either be one or no tile. In a possibly infinite 2d checked board, tiles get laid. Just somehow publish the result (don't just keep it inside a variable) The result can be anything from a text output, a returned boolean or other variable type or whatever you want. The result is thus one of two possible values, either true or false, 1 or 0 or whatever you prefer. It can also be interpreted as 'a board that was created from a valid game, not breaking any of the game's rules'. That is, wether the given board does not break any of the rules. Your task is to calculate wether the given board is in a valid state (see rules down below). You can use any distinct letters as well! There are exactly three tiles of each shape-color combination in the whole set of tiles.Įach line (horizontal or vertical) of touching tiles must contain any distinct tile at most once and only tiles of different color and same shape OR tiles of different shape and same color!Įvery tile has to touch ar least one neighboring tile! No single/islands of tiles! Each tile can be one of six colors (red r, green g, blue b, orange o, purple p, yellow y) and one if six shapes (circle c, square s, flower f, zacks z, small star m, rhombus r). This board can be anything from completely empty to completely filled with tiles (max board size should be at least 32x32). You are somehow (text input, function parameter, whatever) given a board of a Qwirkle game, like a snapshot from any current timeframe within a game. The famous game of Qwirkle has simple but intricate rules (See part 2 of this question for a summary of the rules!)
0 kommentar(er)
