The six-piece burr, also called "Puzzle Knot" or "Chinese Cross", is the most well-known and presumably the oldest of the burr puzzles. This is actually a family of puzzles, all sharing the same finished shape and basic shape of the pieces. The earliest US
patent for a puzzle of this kind dates back to 1917. For many years, the six-piece burr was very common and popular, but was considered trite and uninteresting by enthusiasts. Most of the puzzles made and sold were very similar to one another and most of them included a "key" piece, an unnotched stick that slides easily out. In the late 1970s, however, the six-piece burr regained the attention of inventors and collectors, thanks largely to a computer analysis conducted by the mathematically trained puzzle designer
Bill Cutler which was published by
Martin Gardner in his
Mathematical Games column in Scientific American.
Structure All six pieces of the puzzle are square sticks of equal length (at least 3 times their width). When solved, the pieces are arranged in three perpendicular, mutually intersecting pairs. The notches of all sticks are located within the region of intersection, so when the puzzle is assembled they are unseen. All notches can be described as being made by removing
cubic units (with an edge length of half the sticks' width), as shown in the figure: There are 12 removable cubic units, and different puzzles of this family are made of sticks with different units removed. 4,096
permutations exist for removing the cubic units. Of those, we ignore the ones that cut the stick in two and the ones creating identical pieces, and are left with 837 usable pieces. Theoretically, these pieces can be combined to create over 35
billion possible assemblies, but it is estimated that fewer than six billion of them are actual puzzles, capable of being assembled or taken apart.
Solid burr A burr puzzle with no internal voids when assembled is called a
solid burr. These burrs can be taken apart directly by removing a piece or some pieces in one move. Up until the late 1970s, solid burrs received the most attention and publications referred only to this type. 119,979 solid burrs are possible, using 369 of the usable pieces. To assemble all these puzzles, one would need a set of 485 pieces, as some of the puzzles include identical pieces. and shortly afterwards a level-7 burr was found by the
Israeli Philippe Dubois. In 1990, Cutler completed the final part of his analysis and found that the highest possible level using notchable pieces is 5, and 139 of those puzzles exist. The highest level possible for a six-piece burr with more than one solution is 12, meaning 12 moves are required to remove the first piece. ==Three-piece burr==