sketchucation logo sketchucation
    • Login
    ℹ️ Licensed Extensions | FredoBatch, ElevationProfile, FredoSketch, LayOps, MatSim and Pic2Shape will require license from Sept 1st More Info

    A little Problem...

    Scheduled Pinned Locked Moved Corner Bar
    59 Posts 15 Posters 954 Views 15 Watching
    Loading More Posts
    • Oldest to Newest
    • Newest to Oldest
    • Most Votes
    Reply
    • Reply as topic
    Log in to reply
    This topic has been deleted. Only users with topic management privileges can see it.
    • jeff hammondJ Offline
      jeff hammond
      last edited by

      @unknownuser said:

      You can't say first 9 is heavy!

      ha
      well i did that for sake of explanation..

      regardless, i can figure out the answer in about 5 seconds but i could sit here all day long trying to explain how πŸ˜„
      it's a fault of mine..

      dotdotdot

      1 Reply Last reply Reply Quote 0
      • pilouP Offline
        pilou
        last edited by

        @ Jeff : yes but...no πŸ’š

        You can't say first 9 is heavy!

        You must make first all combinaisons and then say for this combinaison 9 is heavy !
        So draw first all the tree !

        Here your proposition πŸ˜„


        Jeff.jpg

        Frenchy Pilou
        Is beautiful that please without concept!
        My Little site :)

        1 Reply Last reply Reply Quote 0
        • pilouP Offline
          pilou
          last edited by

          πŸ˜„
          If i take you 11 oranges and one false your explanation don't work πŸ˜†
          Only with a 1/24 hasard πŸ˜†

          Frenchy Pilou
          Is beautiful that please without concept!
          My Little site :)

          1 Reply Last reply Reply Quote 0
          • jeff hammondJ Offline
            jeff hammond
            last edited by

            really? the way i see it, you can always find the the heavy one in 3 tries.. you mind showing the 1 out of 24 when it wouldn't work?

            further, using a different starting technique using 12 objects (5vs5), it's possible to find the oddball in 2 tries.. sometimes (17% chance of doing it 2)

            let's say the heavier object is #11..

            place 1,2,3,4,5 on one side and 6,7,8,9,10 on the other.. they weigh the same so that eliminates 1-10

            place #11 on one side and #12 on the other..

            11 weighs more so you've found it in 2 weighings.

            dotdotdot

            1 Reply Last reply Reply Quote 0
            • R Offline
              remus
              last edited by

              Annsi, sorry, typo. 2 is the right answer to the original question πŸ‘

              Ive got another one for you.

              http://upload.wikimedia.org/wikipedia/commons/0/07/Tower_of_Hanoi.jpeg

              (This problem is an extended case of the above problem.)

              The aim is to transfer all the discs from one pole to another without placing a larger disc on a smaller disc at any point.

              The rules for moving the discs:
              -you can only move 1 at a time,
              -a move consists of moving one disc from one pole to another without changing the position of any other discs;
              -a disc must always be placed on a larger disc or directly on the base.

              If i can move the discs at a rate of 10 a minute, how long would it take me to complete a puzzle with 64 discs?

              For additional cool points, can you prove your answer? and how does adding a 4th pillar effect the solution?

              http://remusrendering.wordpress.com/

              1 Reply Last reply Reply Quote 0
              • jeff hammondJ Offline
                jeff hammond
                last edited by

                @remus said:

                If i can move the discs at a rate of 10 a minute, how long would it take me to complete a puzzle with 64 discs?

                wait, you didn't mention what the finished puzzle should be.. do you mean start with the picture and move the stack to a different pole following your guidelines?

                [edit1]oh wait.. 3 poles, all 64 discs are off the poles, then build one stack on one pole?

                [edit2] ok, i think i got it now 😳.. start with a stack of 64 discs on one pole then transfer them to another pole ?

                dotdotdot

                1 Reply Last reply Reply Quote 0
                • pilouP Offline
                  pilou
                  last edited by

                  @Jeff
                  Of course yes, it's just the methodology πŸ˜‰
                  In the real world you will be obliged to make all combinaisons first till find a solution and say this is the false object! πŸ˜‰
                  Try it in the real world and you will see that i am right β˜€

                  Frenchy Pilou
                  Is beautiful that please without concept!
                  My Little site :)

                  1 Reply Last reply Reply Quote 0
                  • R Offline
                    remus
                    last edited by

                    @unknownuser said:

                    wait, you didn't mention what the finished puzzle should be.. do you mean start with the picture and move the stack to a different pole following your guidelines?

                    Thats it, the aim is to move all the discs to another pole following the rules, so for 2 discs the solution would look like this:
                    hanoi1.jpg
                    hanoi2.jpg
                    hanoi3.jpg
                    hanoi4.jpg

                    http://remusrendering.wordpress.com/

                    1 Reply Last reply Reply Quote 0
                    • E Offline
                      Ecuadorian
                      last edited by

                      @remus said:

                      -a disc must always be placed on a larger disc.

                      ...or directly on the base.

                      -Miguel Lescano
                      Subscribe to my house plans YouTube channel! (30K+ subs)

                      1 Reply Last reply Reply Quote 0
                      • R Offline
                        remus
                        last edited by

                        Updated πŸ˜„

                        http://remusrendering.wordpress.com/

                        1 Reply Last reply Reply Quote 0
                        • pilouP Offline
                          pilou
                          last edited by

                          That is more interresting πŸ’š
                          You can win 2 millions $ for make a "little" puzzle πŸ˜„
                          But now make speedy answer : 31 12 2009 end first step of the game! ❗

                          http://idolina.free.fr/images/ludique/logo Eternity.jpg

                          Frenchy Pilou
                          Is beautiful that please without concept!
                          My Little site :)

                          1 Reply Last reply Reply Quote 0
                          • jeff hammondJ Offline
                            jeff hammond
                            last edited by

                            can i just answer 'it's going to take forever' ?
                            that is a huge huge number that i don't really know how to write πŸ˜„

                            i did find a method to obtain the answer though

                            basically,
                            2disc = 3 moves
                            3disc = 7
                            4disc = 15
                            5disc = 31
                            6disc = 63
                            etc..

                            following that sequence, 7discs = 127 then 8 = 255
                            i'll try to get it better than that though.

                            dotdotdot

                            1 Reply Last reply Reply Quote 0
                            • R Offline
                              remus
                              last edited by

                              Good start jeff πŸ‘ Youve got what we in the business call a recursive solution i.e. you can find n+1 if you know n.

                              The general solution should be fairly easy to find from there.

                              http://remusrendering.wordpress.com/

                              1 Reply Last reply Reply Quote 0
                              • R Offline
                                remus
                                last edited by

                                Your a factor of 100 out, you can make 10 moves a minute whereas i guess you took a move takes 10 minutes. Otherwise correct though πŸ‘

                                http://remusrendering.wordpress.com/

                                1 Reply Last reply Reply Quote 0
                                • jeff hammondJ Offline
                                  jeff hammond
                                  last edited by

                                  well, here's the answer i'm going to go with but this stuff is over my head.. i like the practical everyday logic puzzles much better πŸ˜„

                                  184,467,440,737,095,516,150 minutes

                                  [edit] hmm.. maybe that's 10 minutes too long? i guess you don't have to wait 10 minutes before making the very first move.

                                  [edit2] oops agian.. i figured it as if you make one move every 10 minutes instead of 10 per minute..
                                  so maybe it's more like
                                  1,844,674,407,370,955,161 minutes...and 30seconds

                                  dotdotdot

                                  1 Reply Last reply Reply Quote 0
                                  • jeff hammondJ Offline
                                    jeff hammond
                                    last edited by

                                    @remus said:

                                    Your a factor of 100 out, you can make 10 moves a minute whereas i guess you took a move takes 10 minutes. Otherwise correct though πŸ‘

                                    right.. i update my post as you were posting yours.

                                    ok, i'm gonna go eat ice cream now πŸ˜„

                                    dotdotdot

                                    1 Reply Last reply Reply Quote 0
                                    • R Offline
                                      remus
                                      last edited by

                                      Very sensible πŸ‘

                                      http://remusrendering.wordpress.com/

                                      1 Reply Last reply Reply Quote 0
                                      • DanielD Offline
                                        Daniel
                                        last edited by

                                        204 minutes

                                        My avatar is an anachronism.

                                        1 Reply Last reply Reply Quote 0
                                        • R Offline
                                          remus
                                          last edited by

                                          howd you get that?

                                          http://remusrendering.wordpress.com/

                                          1 Reply Last reply Reply Quote 0
                                          • pilouP Offline
                                            pilou
                                            last edited by

                                            is it not the famous HanoΓ― tower? πŸ˜‰

                                            Frenchy Pilou
                                            Is beautiful that please without concept!
                                            My Little site :)

                                            1 Reply Last reply Reply Quote 0
                                            • 1
                                            • 2
                                            • 3
                                            • 1 / 3
                                            • First post
                                              Last post
                                            Buy SketchPlus
                                            Buy SUbD
                                            Buy WrapR
                                            Buy eBook
                                            Buy Modelur
                                            Buy Vertex Tools
                                            Buy SketchCuisine
                                            Buy FormFonts

                                            Advertisement