Skip to content

Instantly share code, notes, and snippets.

@squidarth

squidarth/blokus_problem.md

Last active July 8, 2018 20:07
Show Gist options
  • Save squidarth/527123af3c4f3fe37576c17b2cdde3e9 to your computer and use it in GitHub Desktop.
Save squidarth/527123af3c4f3fe37576c17b2cdde3e9 to your computer and use it in GitHub Desktop.
Download ZIP
Description of the "Blockus" Problem
Raw
blokus_problem.md

The Problem

Blokus is a fun game that involves placing different size/shape/color pieces on a board.

The pieces look like this:

img_9384

img_2166

Each piece has some number of squares in it. For instance, the image on top contains a piece with 4 squares, while the one below contains a piece with 5 squares.

How many unique pieces can you make from N squares?

For a couple examples, if N = 1, you can only make one unique piece. If N = 2, you also can only make one unique piece. If N = 3, you can make two unique pieces:

untitled diagram 1

For N = 4, there are 5 possible unique pieces and N = 5, there are 12.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment