Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 256 Bytes

File metadata and controls

4 lines (3 loc) · 256 Bytes

fillit

A very messy but totally functional implementation of Knuth's Dancing Links algorithm built to determine the best fit of a given set of tetris pieces on a square grid of smallest possible dimension.