Video

I solved this in 3 minutes 40 seconds 127 steps

Why not move them to the second then the third

I solved it in 345 movies 😂😂

Block me little Catholic boy, SMD. That's the only thing you learned at your church if hopelessness. Girls on their knees, you next to the altar mouth wide open, so Satan YAHUAH can enter with his weasel

Then there is Catholic , the none existent brain cells, that's the only ones left in the genitalia realm. I came here to wake you up, not to scare you or grab. I am too high class GENIOUS for that. All you know is our up make up so that you may look like a human in your feces faces

Are there any intelligent ones in this channel subscribers, what he is showing you is for idiots, I am Ingenious GENIOUS FIGEN GENCO. STUPID au seller doesn't even know the word ..smh. so I wrote about a one level up for mid ratio , so called most intelligent MOSLEM girls, lower then that Indian. Rest of you not even my map, Christian not existence, pagan kma, 😅😅

Yes , but too many moves. Put the second one from the bottom on the middle post, and accomplish it in 16 moves, let's see if you have that intelligence

Bro bro... hat's off. U r the messiah....🙏🏻

Cool!

Uniform brings uniformity

its really informative and could u tell me about doc verification if had a mistake in dob how they deal it with and is affidavit acceptable please guide

Madarchot it's to fast

After playing this game again and again and watching the solution i found out the pattern: (Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move)) So this trick is different for odd number of disk and even number of disk First check if the number of disk is even or odd: For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc): • 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole. • 2: then again move the smallest disk to middle pole. • 3: make a move with any other disk . (Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.) • 4: now move the smallest disk to first pole. • 5: make a move with any other disk to any pole. • 6: repeat from • 1 to • 5 untill you are done. This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31 For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc ) All the steps are going to be the same as above with just a simple change. In above sequence we were moving the smallest disk From first pole to last pole Then from last pole to middle pole Then from middle pole to first pole. We were doing this on every second move. For even number of Disk the sequence for moving the smallest disk on every second turn will be: From first pole to middle pole From middle pole to last pole From last pole to first pole All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart) never quit before reaching the minimum number of moves Additional information: If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.

After playing this game again and again and watching the solution i found out the pattern: (Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move)) So this trick is different for odd number of disk and even number of disk First check if the number of disk is even or odd: For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc): • 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole. • 2: then again move the smallest disk to middle pole. • 3: make a move with any other disk . (Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.) • 4: now move the smallest disk to first pole. • 5: make a move with any other disk to any pole. • 6: repeat from • 1 to • 5 untill you are done. This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31 For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc ) All the steps are going to be the same as above with just a simple change. In above sequence we were moving the smallest disk From first pole to last pole Then from last pole to middle pole Then from middle pole to first pole. We were doing this on every second move. For even number of Disk the sequence for moving the smallest disk on every second turn will be: From first pole to middle pole From middle pole to last pole From last pole to first pole All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart) never quit before reaching the minimum number of moves Additional information: If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.

After playing this game again and again and watching the solution i found out the pattern: (Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move)) So this trick is different for odd number of disk and even number of disk First check if the number of disk is even or odd: For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc): • 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole. • 2: then again move the smallest disk to middle pole. • 3: make a move with any other disk . (Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.) • 4: now move the smallest disk to first pole. • 5: make a move with any other disk to any pole. • 6: repeat from • 1 to • 5 untill you are done. This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31 For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc ) All the steps are going to be the same as above with just a simple change. In above sequence we were moving the smallest disk From first pole to last pole Then from last pole to middle pole Then from middle pole to first pole. We were doing this on every second move. For even number of Disk the sequence for moving the smallest disk on every second turn will be: From first pole to middle pole From middle pole to last pole From last pole to first pole All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart) never quit before reaching the minimum number of moves Additional information: If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.

Sir plzz upload a video on your journey from sainik school to microsoft please ❤

Promo-SM

With help from your videos i was able to clear my cpss. Thanks alot. Jai Hind 🇮🇳

Helpful👏💫

What is the name of the game

Big fan guru bhaiya

This music is nostalgic

The gap between the two videos is too long. :(

Hello sir, firstly thanx for this course Could u plz make that remaining 5 videos public it will be very helpful for us

Is this last video?

Thanks for making this video

Sir ji, some of the videos are hidden, any way to access them...?

Promo'SM

Bhiya please provide all cpss games , as Gdrive links are not working now

Ya me to 😂😂😂😂😂😂😂

I did it in 126 move

Is it beneficial for non computer science background?

HAHAHA, he got too famous now :)

Thanks a lot sir, always awaited for your videos

Nice explanation Guru 🙌🏻✨

Great session sir❤. Love ur content😊

🔥🔥

Thanks for making it available on youtube Sir , looking forward for complete course .🎉

Thanks for putting it out there!

thanks for the video bud helps a lot

sir codeblocks mai built kia but graphics wali header file pe error aa rha hai

Noice 😎

👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌

Pls uplaod more questions on math problems

Answer key - 4 5 1 1 All present 5 5 4 1 3 5 2 4 3 2 3 2 4 4 4

Great work bro

Thank you so much Brother. Your playlist helped me a lot. Just cleared CPSS from 1AFSB Dehradun ❤

Why you don’t join navy because in navy you also fly free fighter plains Please answer it.

Build 3 in middle Build 4 in last Build 5 in middle Move last to last Build 4 to first