Stick puzzle
Stick puzzles use sets of 'polysticks' (essentially one-dimensional objects) which have to be assembled into two- or three-dimensional configurations.
Part of a series on |
Puzzles |
---|
Polysticks are configurations of joined or unjoined thin (ideally one-dimensional) 'sticks'. The sticks may be matchsticks, or pieces of straw, wire or similar.
A special (and very old) class of stick puzzles are 'matchstick puzzles', where all parts used are sticks (usually matchsticks) rather than polysticks. Some (trick-)puzzles can only be solved when one assumes that the sticks actually have measurements in more than one dimension.
Examples of stick puzzles
gollark: What, so if you break one block of stone your pickaxe breaks and you suddenly made a giant hole?
gollark: Evil idea #12591250125: turn on veinmining on stone.
gollark: Do you plan to also make your own `type` and `==`? Because that would be neat.
gollark: Also, *how* is it based on Linux?
gollark: <@185901063755268097> Why is learning the overly specific and not very transferable commands of your specific CC "OS" more useful than learning the usual CC Ones?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.