What data structure should I use to represent this board?

Question

 --- --- --- ---
| o | o | o | o |
 --- --- --- ---
| o | o | o | o |
 --- --- --- ---
| o | o | o | o |
 --- --- --- ---
| o | o | o | o |
 --- --- --- ---

Pieces go between circles. The goal is to fill the entire board. I need a way to present the contents of the board. Pieces can be rotated and flipped. I tried using a matrix, but it didn’t work out very well.

Edit: Example:

Answer 1

Since the board is so tiny, one way to get closer to this problem is to present the board as a list of pairs of elements + layouts.

Think of each part as a sequence of drawing commands in a turtle:

• D for "draw"
• R to "turn right"
• L to "turn left"
• T for a "turn".

:

D-L-D-R-D-T-D-R-D
D-L-D-R-D-R-D
D-L-D-T-D-L-D-T-D-L-D

, , , , .

+ , , , "" . , + , "" .

Answer 2

, , , . , 3 × 3:

, , 6 × 6. 8- , , , (, "" Y B / B Y B Y / Y B, ):

         Y Y B B Y Y
         Y Y B B Y Y    Diamond:  Moustache:   Snake:
         B B Y Y B B
         B B Y Y B B      Y B          Y         Y Y
         Y Y B B Y Y      B Y          B       B
         Y Y B B Y Y                 Y

, . , "" "" , -:

, .

Answer 3

.

, , : Dancing Links ( PostScript... ). , , .

Pentomino ( , ):

, .

, 72 : 12 60 .

(1) , , a 1 , ; 1568 .

, , X ( ).

, .

, .

Answer 4

Consider using graph ; although flight paths are used in this example, it is still useful that each position (node ​​on the graph) can have several nodes connected, which is what this question describes in this post. Checking whether the game panel will be full will be just a matter of ensuring that each position (node ​​on the graph) on the board is connected to all other positions (node ​​on the graph). Each part of the board can cover several positions on the board and, thus, connect to these nodes on the chart.