1 / 55

Design of Geometric Puzzles

Design of Geometric Puzzles. Marc van Kreveld Center for Geometry, Imaging and Virtual Environments Utrecht University . http://www.cs.uu.nl/~marc/composable-art/. Two warnings. This is not computational geometry This talk involves user participation . Overview.

jethro
Download Presentation

Design of Geometric Puzzles

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Design of Geometric Puzzles Marc van Kreveld Center for Geometry, Imaging and Virtual Environments UtrechtUniversity http://www.cs.uu.nl/~marc/composable-art/

  2. Two warnings • This is not computational geometry • This talk involves user participation

  3. Overview • Classical puzzles: cube dissections • New cube dissections • Design of a ‘most difficult’ puzzle • Some more puzzles • The present • The future

  4. Two famous cube dissections

  5. Puzzles and blocks

  6. Naef - cubicus

  7. New cube dissection • 6 pieces: 2 of 3 types • 2 types aremirrored

  8. Variation: 8 pieces

  9. Idea for a puzzle • 8 pieces, 1 for each corner of a cube • Adjacent pieces must fit in their shared edge • Every piece has 1 corner and 3 half-edges

  10. Requirements of the puzzle • All 8 pieces different • No piece should be rotationally symmetric • As difficult as possible (unique solution) Does such a puzzle exist?And how do we find it?

  11. Analysis of the pieces • How many different pieces? • There are 4 possibilities for half-edges  call them types A, B, C, D A B A D C

  12. Analysis of the pieces • The type of a piece (BDD): • Choose the alphabetically smallest type(not DDB or DBD, but BDD)

  13. Exercise • Which pieces (types) are these two?

  14. Assignment (2 minutes) • How many different pieces exist?At most 4 x 4 x 4 = 64, but exactly?Hint: • How many with 3 letters the same? • How many with 2 letters the same? • How many with 3 letters different? AAA, AAB, AAC, AAD, ABA, … the same +

  15. Answer • 3 letters the same: 4 • 2 letters the same: 4 choices for double letter, another 3 for single letter: 12 • 3 letters: 4 choices which letter not used, for each choice two mirrored versions (e.g. ABC and ACB): 8 + 24

  16. Which types fit? • A and D always fit; B and C always fit • Nothing else will fit

  17. Additional requirement • Every type of half-edge - A, B, C and D - appears exactly 6 times in the puzzle

  18. The pieces • There are 24 different pieces, but 4 of these we don’t want • There are () = 124,970 sets of 8 different pieces. Which set fits in one unique way? 20 8

  19. A puzzle solver? • For all 8 pieces: Place the first piece • 2nd piece: 7 positions, 3 orientations • 3rd piece: 6 positions, 3 orientations • … • So: 7! · 37 = 11,022,480 ways to fit • All 125.970 candidate puzzles: 1,388,501,805,600 ways to test

  20. Different approach • Take a cube a split all 12 edges in the 4 possible ways

  21. Different approach • When we know how the 12 edges are split, then we know the 8 pieces; this gives the 412 = 16,777,216 solutions ofall cube puzzles! • Test every piece for: not AAA, BBB, CCC, DDD • Test every pair for being different • Test whether A, B, C and D appear 6 x each

  22. Different approach • There are 1,023,360 solutions of puzzles, according to the computer program • Final requirement: Unique solution  Find different solutions that use the same 8 pieces; such puzzles are not uniquely solvable

  23. Results • The 1,023,360 solutions are of 2290 puzzles that fit 3 requirements • The minimum is 24 solutions(34 puzzles) • The maximum is 1656 solutions(4 puzzles) 24 solutions  1 solution

  24. The easiest puzzle • With 1656 69 solutions

  25. Question (1 minute) • All 34 most difficult puzzles use the pieces AAD, ADD, BBC and BCC Is this logical? Explain Note: All 4 easiest puzzles use the pieces AAB, ABB, CCD and CDD, or AAC, ACC, BBD and BDD

  26. Results • 34 different puzzles are uniquely solvable: AAB, AAD, ABC, ADD, BBC, BCC, BDC, CDD AAC, AAD, ACB, ADD, BBC, BCC, BCD, BDD AAD, ACB, ACD, ADB, ADD, BBC, BCC, BDC + another 31 puzzles

  27. … then I made one of these puzzles …

  28. B  C C  B Results • 34 different puzzles are uniquely solvable: AAB, AAD, ABC, ADD, BBC, BCC, BDC, CDD AAC, AAD, ACB, ADD, BBC, BCC, BCD, BDD AAD, ACB, ACD, ADB, ADD, BBC, BCC, BDC + another 31 puzzles

  29. Results • There are 5 equivalence classes in the 34 uniquely solvable puzzles But: is there any difference in difficulty?

  30. Towards a definition of difficulty • How does a puzzler solve such a puzzle?Probably:start with the bottom 4 pieces = 1 loop / lower face of the cube

  31. Towards a definition of difficulty • After making the bottom loop, it is only a puzzle with 4 pieces No. of good loops Difficulty puzzle = Total no. of loops

  32. Assignment (5 minutes) • Make a (crude) estimate of the difficulty of the most difficult puzzleHint: For the total no. of loops, consider a ‘random’ puzzle instead.Recall: There are 6 each of A, B, C and D

  33. Answer • No. of good loops: 6 • Estimate total no. of loops ‘random’ puzzle: • Place a piece, say, with AB on the table • About 5 - 6 half-edges will fit the A, say, 5.25 • About 4 - 5 half-edges will fit the B, say, 4.5 • 4th piece of the loop must fit on 2 sides: probability 1/16;the 5 remaining pieces have 5 x 3 = 15 ordered pairs • This gives an estimate of 5.25 x 4.5 x 15/16 = 22 loops • There are 8 x 3 = 24 choices for the first pair (AB) • We over-count by a factor 4 • So estimated 22 x 24/4 = 132 loops in a puzzle Difficulty puzzle  132/6  22

  34. Computation of difficulty • With a program: the 5 non-equivalent puzzles have 107, 116, 116, 118, and 122 loops • Easiest puzzles & maximum: 230 loops Difficultymostdifficult puzzle = No. of good loops 6 = Total no. of loops 122

  35. … I made one of the easiest of the uniquely solvable puzzles !

  36. How about 6 types? • To be named A, B, C, D, E, and F:E and F havediagonal pinsand fit only oneach other

  37. Question • What happens: still puzzles that fit all requirements (now equal usage of A, B, C, D, E and F)? • Is the new most difficult puzzle more difficult or easier?

  38. More puzzles

  39. A personal puzzle

  40. Hinged puzzle

  41. Gate puzzle

More Related