Tower of Hanoi: 8 Rings Solution:255 perfect moves

แชร์
ฝัง
  • เผยแพร่เมื่อ 1 ม.ค. 2025

ความคิดเห็น • 22

  • @mousumibhaumik1735
    @mousumibhaumik1735 2 ปีที่แล้ว +3

    Thanks now I can be a part of the hall of fame in StayQrious

  • @marcozini8915
    @marcozini8915 4 ปีที่แล้ว +2

    Propongo una soluzione semplice semplice e soprattutto mnemonica. La regola
    è la seguente:
    - in una mossa muovi il disco più piccolo, in modo circolare (paletti: a -> b -> c -> b, -> a, ecc.),
    - in quella successiva ti trovi a dover effettuare l'unica operazione possibile,
    - nella mossa successiva muovi di nuovo il disco più piccolo in modo circolare,
    - nella mossa dopo ti ritrovi a dover effettuare l'unica operazione possibile
    e così via, fino ad aver portato tutti i dischetti dal paletto "a" al paletto di destinazione finale "c".
    La presente regola corregge anche la prima mossa per i dischi dispari,
    in quanto si ripete la prima mossa del disco più piccolo da a -> b e da b -> c.
    Spero di essere stato chiaro, grazie e buon divertimento.

  • @lakshyachoudhary2956
    @lakshyachoudhary2956 7 ปีที่แล้ว +2

    amazing video🙌🙌😎😎🙏🙏

    • @UrGuru
      @UrGuru  7 ปีที่แล้ว

      +lakshya choudhary thank you so much for your constant support bro 😍😍😍

  • @bronzor4886
    @bronzor4886 4 ปีที่แล้ว +11

    This took me 4,133 moves. 1 hour and 40 minutes. Smh

  • @Marco_My_Words
    @Marco_My_Words ปีที่แล้ว +1

    I did this in 9 minutes and 27 seconds on a PC with a mouse using 8 rings and the fewest moves, 255 moves. But it was my first ever attempt, so I guess I can get better at this game if I really try to memorize all the moves.

  • @dr.catcuddler194
    @dr.catcuddler194 6 ปีที่แล้ว +5

    The game is very easy.....one can solve for any number of layers by knowing just 2 to 3 things

  • @aperson6937
    @aperson6937 2 ปีที่แล้ว +1

    I did it

  • @khelxiemedico4153
    @khelxiemedico4153 5 ปีที่แล้ว

    Thank you im doit

  • @dr.catcuddler194
    @dr.catcuddler194 6 ปีที่แล้ว +1

    Just figure out the algorithm