This was for my computer science class. (It wasn't required in the slightest, which is why there is no logic. You're just gonna have to follow the rules yourselves. ) The blue circle is player one. BASIC INFO ~~~~~~~~~~ Player One controls the only piece on the board, shown right. Their goal is to traverse the lines from the outside edge to the center point and back again. Use the arrow keys to move. Do NOT drag and drop. Player Two controls the tiles on the board, adding and removing tiles (Player One cannot travel on a tile that is not there). To remove a tile, click it and it will turn grey. They win by trapping Player One so they can't move. ~~~~~~~~~~ RULES ~~~~~~~~~~ Player Two gets the first turn, and removes 20 tiles, a sixth of the total number of tiles. However, they must adhere to the following: There must always be a path from the center to a point on the outermost edge. (This rule is always in play, even during a turn, and failure to adhere will result in instant loss.) There must be no more than six removed tiles per ring (part of the board pattern are four concentric circles, every area between two adjacent circles constitutes a ring, four in all). Once Player Two is finished, Player One gets to choose their starting point, and moves to any intersection one line away where the line is not touching a removed tile (it's fine if the intersection is touching a removed tile). Player Two continues by placing a tile back (clicking the grey tile), and removing a tile that shares a line with the replaced tile (sharing an intersection doesn't matter). Play continues in this fashion, until Player One makes it to the center and back out, or they have no moves, in which case, Player Two wins.
