Zigguflat - How can a burr be two-dimensional, frameless and n-ary?
Vložit
- čas přidán 27. 10. 2023
- Print it yourself at oskarvandeventer.nl/Print-It-.... Buy at kubekings.com/puzzles-desliza... , www.etsy.com/listing/1601035177 , i.materialise.com/en/shop/ite... or at www.shapeways.com/product/WVB... . Zigguflat is a flat version of Bram Cohen's Ziggurat puzzle. The puzzle is an "n-ary" puzzle. This means that the number of moves to take apart increases exponentially with the number of pieces. What makes Ziggurat (and Zigguflat) special, is that they don't have a frame, unlike all other n-ary puzzles in existence up till now.
Copyright (c) 2023, M. Oskar van Deventer.
Frequently Asked Question: oskarvandeventer.nl/FAQ.html
Buy mass-produced Oskar puzzles at www.puzzlemaster.ca/browse/in... (USA, CA) and www.sloyd.fi/oskar-deventer-c-... (EU)
Buy exclusive 3D-printed Oskar puzzles at shapeways.com/shops/oskarpuzzles and i.materialise.com/shop/design... - Věda a technologie
The fact that you can remove a piece and still be able to make a rectangle is mind boggling.
It's hard to comprehend how you can still get a rectangle with missing pieces. Fascinating!
I think it is base 3. I'm guessing by watching the motion of the orange piece in the first demonstration, estimating the dime difference between 5 and 6 pieces disassembly and assembly which is a reasonable indirect measurement of the number of moves. Very cool puzzle!
This is a really nice puzzle.
Not too difficult or too easy.
Just printed this out. One of the coolest puzzles I have 3d printed so far. It's fun to fidget with besides solving it.
Reminds me a bit of a round locking puzzle that used Grays Binary system. It takes 2x the moves for each new level added to the lock.
N-ary puzzles are indeed directly related to Gray codes
amazing
Thanks a lot for making them. Need some more time to answer the questions.
Wow, this is super cool! Love it!
Glad to see Green Peace left out and the bass should always be down low.
Great puzzle! I printed it myself and had fun on my daily commute. You can also print extra pieces to make it longer.
Great!
The way this looks reminds me of the solution to the Taraki Circle Squaring problem using finite borel sets. A puzzle version of ut would be cool to see, although many of the sets are disconected and unimaginably fragile, the fractal natural nature of the sets required would make the edge geometry infinitely complex and unmakable(if it weren't for approximations and tolerances), and while you can do it with just a handful of pieces, as just a handful cover the vast majority, and proportionally, only like 0.0001% actually cover any surface area while the rest deal with incontinuity, but there are over 2^100 sets, so...
Edit: Correction, its 10^200 sets, though technically that is "over 2^100"
I'm rather confused by the base that this puzzle uses. After some examination I believe that the puzzle is technically quaternary, but once any piece pair leaves its initial 0 position it never has to return to that position. Perhaps we could call it 3.5-ary?
Awesome! See you there, Oskar!
I can't answer your question but again, your mind is so brilliant!
Reminds me a lot of a "barcode burr" puzzle i really liked
Indeed same "n-ary" category
I count twice as many "moves" for the six piece version over the five piece version, so... base 2? But that's based on a naive guess based on two data points, so who can say.
Also, I counted the number of "closed" motions and maybe i should have counted "open" motions.
Also I may have just miscounted.
23 and 13 in+outs for each, so binary?
Wow, this is very nice puzzle! I love it! 😍❤👍 Maybe its time for some 3D printer... 🙂
What other types of frameless burrs can you invent?
If I new that, I would invent them.
awesome. the class of this puzzle is "binary" puzzle in n-ary puzzle, right?
hmm... k+1-th piece's move needs 3 k-th piece's move...
Damn your drunk driving tests are hard.
It’s all about that base, that base, that base, no treble…
While I may be really late, i have my own. In my own experimentation, i counted 113 minimum moves for 6 pieces. And i figured out a formula for the number of moves. 2^(x+1)-2x-3.
I used your formula and found out that you only need 33 pieces for the puzzle to be entirely impossible in a human lifetime if 4 moves are made per second and sleep/work does not exist
17.4 billion moves taking 139 years
Is this the first frameless 2-dimensional n-ary puzzle?
Yes
How is it always warm enough where you live for you to sit outside in a sweater no matter the season?
Netherlands has a very moderate climate
Qué ledicia cada vez que publicas unha nova xenialidade, sempre pareces ir un pouco máis alá. Sacas novas mecánicas cunha regularidade apaixonante. Ás veces recórdasme a Doraemon co seu peto máxico :D Unha aperta, a ver cando volves por estes lares.
Thank you!
i think the base is buttery biscuit
What is a burr though
en.wikipedia.org/wiki/Burr_puzzle
1:32 “i’m leaving out the green piece” not the only green peace that can be left out without a problem…
Isn't this just the Hanoi towers over again?
Eh, yeah, that is what n-ary implies. Hanoi Towers is a classic example