What other challenges should we do in multiplayer? I'm thinking of building something that completely catches the guys off guard and doesn't even fit what we were supposed to build for the week...
FYI it's called "Tower of Hanoi"... usually you would only have 3 places (the one with the assembled tower, and 2 empty spaces and you're supposed to move the tower to the last spot). Edit: So yeah, it is possible with 3 platforms, because that's the setup of the original "Tower of Hanoi". Btw. the solution is simple recursion. In order to move a tower of n, you simply move the top part, then move the tower of n-1 onto the empty spot, and then move the n-th part on top of that. That results in a total move count of (2^n)-1 (2 to the power of n and the result minus 1) for how many moves you need to move a tower of size n from one place to another. So with a 5 high tower you would need 31 steps. If you need more, then you're doing something wrong in between resulting in more (unnecessary) steps.
With a 5 stack (1, 2, 3, 4, 5) with 4 total squares (Labled A, B, C, D) it should be 13 moves: 1, A to D 2, A to C 3, A to B 2, C to B 1, D to B 4, A to C 5, A to D 4, C to D 1, B to A 2, B to C 3, B to D 2, C to D 1, A to D Unless I made a mistake
Yea, I was surprised when kAN said he didn't know if it was possible with 3 because I learned about this game in a coding class when they were teaching the concept of recursion. I assumed he had a similar experience because he uses so many computer science concepts in his videos.
@ 64! a big tower, so I’m glad we have plenty of time. Unless you meant 64 in which case we only have, assuming 1 move is made every second, 584.542(1) Aeons till the end of the universe, instead of whatever 64! Is, because that is too big for the calculators I have access to.
Multiplayer Idea! Hungry Hungry Hippos! You each could make different arena shapes, different collectors, different balls I think you guys could come up with a bunch of variations by tweaking different parts. But I think what ever you collect, there should be a lot of them and they should move by themselves.
Kan I’ve been watching you for YEARS ever since I was little, through multiple TH-cam accounts I haven’t commented, I just wanted to say that you’ve been an amazing influence and I love your videos
The trick here is when you have 3 platforms, and an odd number of blocks, always start by putting the small one in the ending platform. If you have an even number, put the small one in the middle platform. The rest will sort itself out.
6:25 You can definitely do it with 3. it is just harder to target exactly which spot the tower ends up in and adds 3 times as many moves. In high-school we were asked to figure out how long it would take to do this with a tower of 64 levels and only 3 pegs.(AKA the origin of this "toy")
The number of steps is equal to 2 to the power of n, where n is the number of pegs/levels, and you can quickly identify it based on whether you have an even or odd number
It is easy to target. If you have an odd number of blocks, move the first one to the final destination. If you have an even number, move it to the other spot. As for number of moves, 4 platforms makes it very complicated. But it isn't simply 3 times.
If you only have 3 platforms, it is called Towers of Hanoi, and there is always a solution. You can break it down to a recursive function. Say you have 3 bases, A, B and C. And you want to move from A to C. Move the entire tower except the bottom to B, then move the bottom to C, then move the entire tower except the bottom to C. How do you move the entire tower except the bottom? Well treat it as its own tower. Move the entirety of that tower except its bottom to C, then move the bottom to B, then move the entire tower excluding the bottom to B. And so on, with you going up 1 layer at a time. And as you go up, that means all the pieces you aren't considering are larger, so you can move to any platform. As for number, this setup of 3 platforms takes moving the base plus 2 * moving the tower. This results in 2^n-1 so for 1 block it is 1 step, for 2 it is 3, for 3 it is 7 and so on. For 5 it is 31. Giving the 4th platform makes it a lot more complicated to optimise.
The game is called Tower of Hanoi. It is played with 3 towers and you have to move the stack from one tower to another. Depending on the amount of levels is the amount of moves required. The minimal moves required is 2^n-1 (n the amount of levels). 7 levels it typical which is 127 moves. 12 levels is 4095 moves. This was one of my favorite games for learning some basic math proofs.
Ah as a warehouse worker myself, i like to think that Kosmo's stack is how a pallet stack looks like as you are getting it out of the back of a trailer lol
this is similar to the Lucas Tower puzzle, where you can't put the bigger piece on top on the smaller ones, which yes you can make this challenge with one less square section of the platforms there.
It's actually possible in 13 moves. First, put crate 1, 2 and 3 on the three empty platforms, making sure that 3 is not on the platform where the tower should be in the end (3 moves). Then stack 2 and 1 on top of 3 (2 moves). Then 4 and 5 on the empty platforms, with 5 obviously on the target platform (2 moves). Put 4 on 5 (1 move). Then 1 and 2 off of 3 onto the empty platforms (2 moves). And finally, 3, 2 and 1 on top of 4 (3 moves). Total: 3+2+2+1+2+3=13 moves
good thing kan had SUCH A FUN CHALLENGE THIS WEEK... lol yeah this is leagues better than last time they did a crate stacking challenge. this could be arguably fun but like once you've done this puzzle once in any game its the same in every game. be cool if they had to build their own lifts though!
Multiplayer idea : Do a big rig triple trailers challenge (18 wheeler with 3 trailers) either have them build it or have some setup for them and make a road course with obstacles and places where they have to deliver the trailers to and then bobtail (drive 18 wheeler without trailers) back to the finish line. Might need to do 1 player at a time to go since that would be a big track to build depending on how many players you have, like a time attack run.
See I figured it was possible with 30+ moves on 3 platforms but I also figured the guys would lose interest since they have the attention span of a goldfish usually.
@@kANGaming Keep in mind, that's a 31 move minimum. If you move one piece to the wrong slot once, you increase the amount of moves by ALOT. Your 4th slot did amazing work making it only a 13 move minimum. Much more reasonable for the guys.
13 moves: 1.) 1 to slot 4 2.) 2 to slot 3 3.) 3 to slot 2 4.) 2 to slot 2 5.) 1 to slot 2 6.) 4 to slot 3 7.) 5 to slot 4 8.) 4 to slot 4 9.) 1 to slot 1 10.) 2 to slot 3 11.) 3 to slot 4 12.) 2 to slot 4 13.) 1 to slot 4 Both kosmo and scraps messed up, you need either slot 2 or slot 3 open by the end of turn 2 and have piece 3 out by the end of turn 3. Anything else would be a time-loss. You do not want to place piece 3 as the first piece in slot 4. You wanna get piece 5 in the correct position as soon as possible (turn 7) which you can't do if you don't clear slot 4 + 1 of the two middle slots by the end of turn 4. You cannot do this if piece 3 was ever placed in slot 4.
How to do this puzzle with only 3 slots: 31 moves: 1.) 1 to slot 3 2.) 2 to slot 2 3.) 1 to slot 2 4.) 3 to slot 3 5.) 1 to slot 1 6.) 2 to slot 3 7.) 1 to slot 3 8.) 4 to slot 2 9.) 1 to slot 2 10.) 2 to slot 1 11.) 1 to slot 1 12.) 3 to slot 2 13.) 1 to slot 3 14.) 2 to slot 2 15.) 1 to slot 2 16.) 5 to slot 3 17.) 1 to slot 1 18.) 2 to slot 3 19.) 1 to slot 3 20.) 3 to slot 1 21.) 1 to slot 2 22.) 2 to slot 1 23.) 1 to slot 1 24.) 4 to slot 3 25.) 1 to slot 3 26.) 2 to slot 2 27.) 1 to slot 2 28.) 3 to slot 3 29.) 1 to slot 1 30.) 2 to slot 3 31.) 1 to slot 3 This is the minimum steps needed to get the solution from my estimates. You made the right call kan adding an extra slot. You changed a 31 step minimum into a 13 step minimum. Much more reasonable for the guys.
31 steps 5 pieces (1 to 5) 3 spaces a,b,c starting at a. 1 to c 2 to b 1 to b 3 to c 1 to a 2 to c 1 to c 4 to b 1 to b 2 to a 1 to a 3 to b 1 to c 2 to b 1 to b 5 to c 1 to a 2 to c 1 to c 3 to a 1 to b 2 to a 1 to a 4 to c 1 to c 2 to b 1 to b 3 to c 1 to a 2 to c 1 to c
I just paused the video to try and figure out how to get the minimum moves (31) with 5 disks and 3 pegs Took me like 30 - 45 minutes, but I feel accomplished 💀
So there IS a solution with 3 platforms. I actually had a math exercise with the question : how many steps for a n-stages tall starting stack ? EDIT: 2**n + 1 steps are required
One too many stacks IMHO. You can do it with only 3. Bioware did that exact puzzle in KOTOR and Mass Effect. Edit* Apparently it's called a Tower of Hanoi, and they only have 3 columns Kan...
It's called the "Towers of Hanoi" and it isn't so much a "preschool game" as it is an apocryphal piece of Hindu religious iconography that takes 2^(number of plates) - 1 steps to complete. Supposedly, when a 64 plate version is complete, the world will end. So your lore is a bit off on that one kAN. -edit also you're supposed to only have 3 spots.
I don't know if this is true, but supposedly, the (scholars?monks?) wherever this was first made thought it unsolvable, and that the world would end if anyone eventually ever did so. Then again, my memory of this is pretty foggy, and it was probably just a story from a math textbook, anyway.
Thinking?!?! 🤔💬 I think Thinking is optional 😆😂😆 It's a lucky there are four pads, kan could have put three 😆😂😆😂😆😂😆😂😆 😆😂😂 Crash boom 💥🤯💥 pallets strawn everywhere 😱 Not my job ... Walks away whistling 🎶🎼🎵. 😉😁☺️
What other challenges should we do in multiplayer? I'm thinking of building something that completely catches the guys off guard and doesn't even fit what we were supposed to build for the week...
the 4 platform version is possible in 13 steps, and the 3 platform version is possible in 31 steps
BRING BACK MOONBO PLEASE
@@missing_therapy388 hes not doing youtube no more
It is criminal to not have moonbo to a FORKLIFT challenge.
RIP Moonbo
Social suicide is self afflicted
Only axolot themselves have the power to summon moonbo
@3:30 Moonbo mentioned.
FYI it's called "Tower of Hanoi"... usually you would only have 3 places (the one with the assembled tower, and 2 empty spaces and you're supposed to move the tower to the last spot).
Edit: So yeah, it is possible with 3 platforms, because that's the setup of the original "Tower of Hanoi".
Btw. the solution is simple recursion. In order to move a tower of n, you simply move the top part, then move the tower of n-1 onto the empty spot, and then move the n-th part on top of that.
That results in a total move count of (2^n)-1 (2 to the power of n and the result minus 1) for how many moves you need to move a tower of size n from one place to another.
So with a 5 high tower you would need 31 steps. If you need more, then you're doing something wrong in between resulting in more (unnecessary) steps.
With a 5 stack (1, 2, 3, 4, 5) with 4 total squares (Labled A, B, C, D) it should be 13 moves:
1, A to D
2, A to C
3, A to B
2, C to B
1, D to B
4, A to C
5, A to D
4, C to D
1, B to A
2, B to C
3, B to D
2, C to D
1, A to D
Unless I made a mistake
@@Brythnoth_of_the_Voidyeah, 13 works, not sure if there is a better solution but I doubt it
Yea, I was surprised when kAN said he didn't know if it was possible with 3 because I learned about this game in a coding class when they were teaching the concept of recursion. I assumed he had a similar experience because he uses so many computer science concepts in his videos.
In the original legend of the Tower of Hanoi, the stack size is 64! After the final plate is moved to the 3rd position, the world will end.
@ 64! a big tower, so I’m glad we have plenty of time. Unless you meant 64 in which case we only have, assuming 1 move is made every second, 584.542(1) Aeons till the end of the universe, instead of whatever 64! Is, because that is too big for the calculators I have access to.
o no not Moonbo. he will just pick up the whole tower and move it all at one time. he likes short cuts. love his race tracks he makes.
Multiplayer Idea! Hungry Hungry Hippos!
You each could make different arena shapes, different collectors, different balls
I think you guys could come up with a bunch of variations by tweaking different parts.
But I think what ever you collect, there should be a lot of them and they should move by themselves.
this is peak
They did this once, but I remember it being a laggy mess. I’d like to see it revisited with the new physics update.
There is a lot you could do with arena design for such a game
Yeah, bring Moonbo back!
I was gonna say the same thing 😂
It'd be good to see him again with the boys, wander how he's doing.
@@dirkkrohn1907 they should do a 2v2 speef with him!
kAN mentioned in another video that Moonbo is busy with other things right now
@ I remember that
13:00 "You know, they're three-year-olds that do this."
And those three-year-olds should probably have their forklift licenses revoked.
Ah yes. Forklift and stacking.
I see you've STACKED the odds against your friends, but it's still such an UPLIFTING experience.
Hello Sans.
6:19 it's called Towers of Hanoi
The game is called the Tower of Hanoi. It took me 31 moves to do a 5 tall stack on 3 platforms.
that or Lucas Tower puzzle there
Kan I’ve been watching you for YEARS ever since I was little, through multiple TH-cam accounts I haven’t commented, I just wanted to say that you’ve been an amazing influence and I love your videos
This game is called towers of Hanoi. And typically it is only played with 3 slots (left, middle and right).
The trick here is when you have 3 platforms, and an odd number of blocks, always start by putting the small one in the ending platform. If you have an even number, put the small one in the middle platform. The rest will sort itself out.
with the new physics MINING is so much better - do a mining challenge, first one to fill up 3 containers
Tower of Hanoi has a specific algorithm that works with any number of discs on 3 towers, but the time to do it grows exponentially
6:25 You can definitely do it with 3. it is just harder to target exactly which spot the tower ends up in and adds 3 times as many moves.
In high-school we were asked to figure out how long it would take to do this with a tower of 64 levels and only 3 pegs.(AKA the origin of this "toy")
The number of steps is equal to 2 to the power of n, where n is the number of pegs/levels, and you can quickly identify it based on whether you have an even or odd number
It is easy to target.
If you have an odd number of blocks, move the first one to the final destination.
If you have an even number, move it to the other spot.
As for number of moves, 4 platforms makes it very complicated. But it isn't simply 3 times.
I hope you had to program it because that would be over 18 quintillion steps if I got my math right
I hope you had to program it because that would be over 18 quintillion steps if I got my math right
@@lazydk2654iirc it’s (2^n)-1 because you can solve for n=1 in 1 step and n
Kosmo tossing out the union card there quick
A claw machine game might work.
That would be rad
It can be done in 13 moves for sure, just not sure if you can do less.
I did it in my head and havent found a solutipn, the algorithm would be fun
That's the minimum that I can calculate as well.
Do Jenga with forklifts next multiplayer Monday. That would really test the physics (and your friendships).
If you only have 3 platforms, it is called Towers of Hanoi, and there is always a solution.
You can break it down to a recursive function. Say you have 3 bases, A, B and C. And you want to move from A to C.
Move the entire tower except the bottom to B, then move the bottom to C, then move the entire tower except the bottom to C.
How do you move the entire tower except the bottom? Well treat it as its own tower. Move the entirety of that tower except its bottom to C, then move the bottom to B, then move the entire tower excluding the bottom to B.
And so on, with you going up 1 layer at a time.
And as you go up, that means all the pieces you aren't considering are larger, so you can move to any platform.
As for number, this setup of 3 platforms takes moving the base plus 2 * moving the tower. This results in 2^n-1
so for 1 block it is 1 step, for 2 it is 3, for 3 it is 7 and so on. For 5 it is 31.
Giving the 4th platform makes it a lot more complicated to optimise.
Moonbo would have aced this in like 3 moves! he's that good!
i do miss moonbo i hope he's doing allright.
The game is called Tower of Hanoi. It is played with 3 towers and you have to move the stack from one tower to another. Depending on the amount of levels is the amount of moves required. The minimal moves required is 2^n-1 (n the amount of levels). 7 levels it typical which is 127 moves. 12 levels is 4095 moves.
This was one of my favorite games for learning some basic math proofs.
Tower of Hanoi is the name of the general mathematical concept. Really fun and proven to be always doable by induction. Crazy.
That was the definition of "slow and steady wins the race" lol
Ah as a warehouse worker myself, i like to think that Kosmo's stack is how a pallet stack looks like as you are getting it out of the back of a trailer lol
I'd never want to invade on moonbo's privacy, but we'd just be happy to know he's doing well
this is similar to the Lucas Tower puzzle, where you can't put the bigger piece on top on the smaller ones, which yes you can make this challenge with one less square section of the platforms there.
Instead of I miss you mumbo it's I miss you Moonbo
It's actually possible in 13 moves.
First, put crate 1, 2 and 3 on the three empty platforms, making sure that 3 is not on the platform where the tower should be in the end (3 moves).
Then stack 2 and 1 on top of 3 (2 moves).
Then 4 and 5 on the empty platforms, with 5 obviously on the target platform (2 moves).
Put 4 on 5 (1 move).
Then 1 and 2 off of 3 onto the empty platforms (2 moves).
And finally, 3, 2 and 1 on top of 4 (3 moves).
Total: 3+2+2+1+2+3=13 moves
Usually there's only three spaces.
The pattern would be different with four available spaces to put the blocks on.
good thing kan had SUCH A FUN CHALLENGE THIS WEEK... lol yeah this is leagues better than last time they did a crate stacking challenge. this could be arguably fun but like once you've done this puzzle once in any game its the same in every game. be cool if they had to build their own lifts though!
Lmao hearing Kan say Towers of Hanoi is a preschool thing had me in the corner with PTSD from reliving cs1301
Simple and fun. These are the best MM's. Go back to some of your early multi's. Could find some cool ideas to revisit.
OSHA called. They said they want their drivers back. 😊
Multiplayer idea : Do a big rig triple trailers challenge (18 wheeler with 3 trailers) either have them build it or have some setup for them and make a road course with obstacles and places where they have to deliver the trailers to and then bobtail (drive 18 wheeler without trailers) back to the finish line. Might need to do 1 player at a time to go since that would be a big track to build depending on how many players you have, like a time attack run.
Shapes into shaped holes on a lid that leads into a bottom container, Toddler Shape Game
Now I'm tempted to search for some forklift fail compliations
5:08 Kosmo making potsu references lol
We had to write a Towers of Hanoi game in Basic on Apple IIs in high school. And now I feel old.
I think for this variation of hanoi tower the minimum is 13 moves
The three platform solution has many names including the Tower of Hanoi. For five layers the optimal solution is 31 moves.
See I figured it was possible with 30+ moves on 3 platforms but I also figured the guys would lose interest since they have the attention span of a goldfish usually.
@@kANGaming Keep in mind, that's a 31 move minimum. If you move one piece to the wrong slot once, you increase the amount of moves by ALOT. Your 4th slot did amazing work making it only a 13 move minimum. Much more reasonable for the guys.
13:59 Ah... OSHA OSHA!!!! 😂
Kosmo is the guy that keeps breaking the doors computer boxes at my dads workplace by driving into the rolling shutter...
wish youd do more of these. the hide and seek and spliff have gotten old
13 moves:
1.) 1 to slot 4
2.) 2 to slot 3
3.) 3 to slot 2
4.) 2 to slot 2
5.) 1 to slot 2
6.) 4 to slot 3
7.) 5 to slot 4
8.) 4 to slot 4
9.) 1 to slot 1
10.) 2 to slot 3
11.) 3 to slot 4
12.) 2 to slot 4
13.) 1 to slot 4
Both kosmo and scraps messed up, you need either slot 2 or slot 3 open by the end of turn 2 and have piece 3 out by the end of turn 3. Anything else would be a time-loss. You do not want to place piece 3 as the first piece in slot 4. You wanna get piece 5 in the correct position as soon as possible (turn 7) which you can't do if you don't clear slot 4 + 1 of the two middle slots by the end of turn 4. You cannot do this if piece 3 was ever placed in slot 4.
slot 4 isn't needed, according to the Lucas Tower puzzle.
@@Charles-7 ya, i have the solution to 3-slot in a separate comment.
Yes!! Get Moonbo back for a couple of these MM.
How to do this puzzle with only 3 slots:
31 moves:
1.) 1 to slot 3
2.) 2 to slot 2
3.) 1 to slot 2
4.) 3 to slot 3
5.) 1 to slot 1
6.) 2 to slot 3
7.) 1 to slot 3
8.) 4 to slot 2
9.) 1 to slot 2
10.) 2 to slot 1
11.) 1 to slot 1
12.) 3 to slot 2
13.) 1 to slot 3
14.) 2 to slot 2
15.) 1 to slot 2
16.) 5 to slot 3
17.) 1 to slot 1
18.) 2 to slot 3
19.) 1 to slot 3
20.) 3 to slot 1
21.) 1 to slot 2
22.) 2 to slot 1
23.) 1 to slot 1
24.) 4 to slot 3
25.) 1 to slot 3
26.) 2 to slot 2
27.) 1 to slot 2
28.) 3 to slot 3
29.) 1 to slot 1
30.) 2 to slot 3
31.) 1 to slot 3
This is the minimum steps needed to get the solution from my estimates. You made the right call kan adding an extra slot. You changed a 31 step minimum into a 13 step minimum. Much more reasonable for the guys.
The faster way, move 1 and 2, drop 3 and 4, move 5, reset 4, move 4, reset 3, move 3, move 2, move 1.
You should be able to do this one in 31 moves? According to the formula 2^n-1, with n being the amount of boxes
OSHA is going to hear about this smh.
You should make a big overhead crane and make coils for them to move around. My job is the inspiration of the idea lmfao
Forklift was the challenge we met along the way
never in my 8 years of playing this game would i think that this is what kan is up to now days lol
though not too surprising
do you guys have your forklift certification?
It is possible to do 5 on 3 blocks, I figured it out in 53 steps.... I honestly doubt you can do it in less
31 steps 5 pieces (1 to 5) 3 spaces a,b,c starting at a.
1 to c
2 to b
1 to b
3 to c
1 to a
2 to c
1 to c
4 to b
1 to b
2 to a
1 to a
3 to b
1 to c
2 to b
1 to b
5 to c
1 to a
2 to c
1 to c
3 to a
1 to b
2 to a
1 to a
4 to c
1 to c
2 to b
1 to b
3 to c
1 to a
2 to c
1 to c
indeed it's possible, it's called the Lucas Tower puzzle or Tower of Hanoi.
I just paused the video to try and figure out how to get the minimum moves (31) with 5 disks and 3 pegs
Took me like 30 - 45 minutes, but I feel accomplished 💀
Same. 31 steps minimum. Glad kan added an extra slot to narrow it down to only a 13 step minimum.
Come and seeeeee
What will beeeeee
In our wooorld of oooosha violaaaationssss
when i read the title for a second i only thought of zeepkist and was wondering wtf kind of map did he do
this problem is called as Towers of Hanoi.
that or Lucas Tower puzzle
I had to make a algorithm for solving this with n blocks last semester
Great video Mark- I mean, kAN!
this reminds me of a old series from a youtuber called rcsparks, he did a show called loading kings/wars. it looked fun and annoying at the same time.
Can we do a spin the wheel for random (necessary) part
"pre-school game"? Hahaha, yeh, Towers of Hanoi is a very old logic puzzle
Wedges are available in crashlander survival.
Hi kAN! Please try a game called: recharge when it comes out next year!
lets see if this is better than scrap mans 🤔
Im buying this game on christmas
Can. Not. Wait.
this version can be done in 13 moves
and ones less slot there too,
Since when did the Hanoi tower become a kindergarten toy?
next time, make a 24 stack
what does kosmo say at 4:25 ?
So there IS a solution with 3 platforms. I actually had a math exercise with the question : how many steps for a n-stages tall starting stack ? EDIT: 2**n + 1 steps are required
What would've happened if multiple blocks were dropped
One too many stacks IMHO. You can do it with only 3. Bioware did that exact puzzle in KOTOR and Mass Effect. Edit* Apparently it's called a Tower of Hanoi, and they only have 3 columns Kan...
Should've put an OSHA jumpscare warning =( . My uncle just passed out
Semi truck race with trailer swap
With 5 elements the minimum number of moves us 2^5-1 so 15 moves
2^5-1 would be 31, which is the answer if you use 3 spots, like thr original tower of hanoi. This one can be done in 13
@@lazydk2654 OOOH they have more then 2 spots, i geniuanely did not notice, my bad
I want the old mm back
this is PAINFUL
It's called the "Towers of Hanoi" and it isn't so much a "preschool game" as it is an apocryphal piece of Hindu religious iconography that takes 2^(number of plates) - 1 steps to complete. Supposedly, when a 64 plate version is complete, the world will end. So your lore is a bit off on that one kAN.
-edit
also you're supposed to only have 3 spots.
Fire kosmo and bring back moonbo
I don't know if this is true, but supposedly, the (scholars?monks?) wherever this was first made thought it unsolvable, and that the world would end if anyone eventually ever did so.
Then again, my memory of this is pretty foggy, and it was probably just a story from a math textbook, anyway.
kAN im disapointed, you reduced the number of pistons with binary extension lengths, but didnt make a logic system to select said heights...
Wait, it took you 16 steps? How'd you manage that?
By the end of turn 2, they had slot 4 open. That's how.
Is Kan Forklift Certified?
What happened to Moonbo anyway?
Whatever happened to moonbo?
No way im this early! Will the legend respond?
aka the hanoi towers
Thinking?!?! 🤔💬
I think Thinking is optional 😆😂😆
It's a lucky there are four pads, kan could have put three 😆😂😆😂😆😂😆😂😆
😆😂😂 Crash boom 💥🤯💥 pallets strawn everywhere 😱
Not my job ... Walks away whistling 🎶🎼🎵. 😉😁☺️
13 moves for me, assuming I did it in my head correct.
👍
Also, every time I see a new video from kAN I go Kahnnnnnnnnnnnnnnnnnnnnnn😊
oh! the ADHD test. lets see who has it!
Nice
Hello World!
Hello!
Tower of hanoi
I've never been this early wow