#Tiling #Consider a 2 n × 2 n chessboard. You are given integers i, j and (4 n − 1)/3 L-shaped tiles. An L-shaped tile is obtained by removing 1 × 1 square from a 2 × 2 square. Goal is to place the tiles on the board so that all squares except the square in row i column j is covered.
Consider a 2 n × 2 n chessboard. You are given integers i, j and (4 n − 1)/3 L-shaped tiles. An L-shaped tile is obtained by removing 1 × 1 square from a 2 × 2 square. Goal is to place the tiles on the board so that all squares except the square in row i column j is covered.
db-coder/Tiling
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Consider a 2 n × 2 n chessboard. You are given integers i, j and (4 n − 1)/3 L-shaped tiles. An L-shaped tile is obtained by removing 1 × 1 square from a 2 × 2 square. Goal is to place the tiles on the board so that all squares except the square in row i column j is covered.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published