<commit_before># Title

Kanoodle

# Difficulty

Hard

# Description

The game of Kanoodle provides 12 distinctly shaped pieces (triminoes, tetraminoes and pentaminoes) and asks the player to assemble them into a 5 by 11 rectangular grid. 

The pieces are (and they're given here made up with different letters to help you see them in place). Pieces may be rotated, flipped, etc to make them fit but you may not overlap them or leave any blank squares in the 5x11 grid. 

     A
     A
    AA

     B
    BB
    BB

     C
     C
     C
    CC

     D
     D
    DD
     D
 
     E
     E
    EE
    E

    F
    FF

      G
      G
    GGG

      H
     HH
    HH

    I I
    III

    J
    J
    J
    J

    KK
    KK

     L
    LLL
     L
 
A solution is found when: 

- Every piece is used exactly once.
- Every square in the grid is covered exactly once.

## Note

This is an instance of the exact cover problem. There's "Algorithm X" by Knuth for finding solutions to the exact cover problem. It's not particularly sophisticated; indeed Knuth refers to it as "a statement of the obvious trial-and-error approach."

# Challenge Output

Your program should be able to omit a solution to this challenge. Bonus points if you can discover all of them. <commit_msg>clarify what a solution is<commit_after># Title

Kanoodle

# Difficulty

Hard

# Description

The game of Kanoodle provides 12 distinctly shaped pieces (triminoes, tetraminoes and pentaminoes) and asks the player to assemble them into a 5 by 11 rectangular grid. 

The pieces are (and they're given here made up with different letters to help you see them in place). Pieces may be rotated, flipped, etc to make them fit but you may not overlap them or leave any blank squares in the 5x11 grid. 

     A
     A
    AA

     B
    BB
    BB

     C
     C
     C
    CC

     D
     D
    DD
     D
 
     E
     E
    EE
    E

    F
    FF

      G
      G
    GGG

      H
     HH
    HH

    I I
    III

    J
    J
    J
    J

    KK
    KK

     L
    LLL
     L
 
A solution is found when: 

- Every piece is used exactly once.
- Every square in the grid is covered exactly once.

## Note

This is an instance of the exact cover problem. There's "Algorithm X" by Knuth for finding solutions to the exact cover problem. It's not particularly sophisticated; indeed Knuth refers to it as "a statement of the obvious trial-and-error approach."

# Challenge Output

The puzzle is to arrange the above tiles into a four sided figure with no gaps or overlaps. 

Your program should be able to emit a solution to this challenge. Bonus points if you can discover all of them. 
{'fraction_non_alphanumeric': 0.029912911775842484, 'fraction_numerical': 0.00605831124574025, 'mean_word_length': 2.086448598130841, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3692874', 'n_tokens_mistral': 841, 'n_tokens_neox': 749, 'n_words': 418}