# Tag Info

17

It can be done with Some explanation: Since

9

Boom, Icosaetris for Zilvarro! This is only the final result; full write-up is below. I think the solution is unique (at least if I made no mistakes (EDIT: turns out I did.)), because the deduction chains needed were of reasonable length, as long as I picked the appropriate variations to rule out. (Which was the hard part). Edit: Here's the promised write-...

5

A simple solution involves Stack the first five arranged the same direction (on the side of the T with the bottom facing either left or right. In my example, the bottom is facing the right). This eliminates the second row (shown with Xs through them). Next, flip the T 180 degrees so the bottom is facing the other direction and fill the gaps as such. This ...

4

If Alice can win, Bob should attempt to force a draw. If Bob can win, Alice should attempt to force a draw. So long as either player can force a draw, the game must end in a draw. Either player can indeed force a draw by making every line unable to be completed. You can use the "L" pieces along the edge of the board to make a 1x2 or 2x1 "nook" of empty space ...

3

I solved the puzzle, and found that the solution is not quite unique: In the bottom right corner, there are three possible arrangements of three pieces: Either J, L, O, or L, J, O or J, Z, L. These are indicated by the top left dots, bottom dots, and top right dots, respectively. The main techniques I used were: Connecting squares to each other, one at a ...

Only top voted, non community-wiki answers of a minimum length are eligible