The Devil's Algorithm (Mini Documentary)
ฝัง
- เผยแพร่เมื่อ 2 ก.ค. 2024
- In this video, I explore the Devil's Algorithm! Could such a thing really exist? Watch the video to find out!
0:00 Intro Skit
1:22 Intro
2:01 Naming
3:41 Trying Bad Devil's Algorithms
5:06 Graph Theory
7:40 Restricted 2x2 Devil's Algorithm
9:25 3x3x1 Devil's Algorithm
11:09 Outro
Music used:
Monkeys Spinning Monkeys by Kevin MacLeod
Link: incompetech.filmmusic.io/song...
License: filmmusic.io/standard-license
Happy Bee by Kevin MacLeod is licensed under a Creative Commons Attribution license (creativecommons.org/licenses/...)
Source: incompetech.com/music/royalty-...
Artist: incompetech.com/
Carefree by Kevin MacLeod is licensed under a Creative Commons Attribution 4.0 license. creativecommons.org/licenses/...
Source: incompetech.com/music/royalty-...
Artist: incompetech.com/
LEMMiNO - Cipher
• LEMMiNO - Cipher (BGM)
Thanks for watching! Check out some of my other videos and don't forget to like and subscribe! :)
More Blobinati:
Blobinati 2 - / @rowanfortierplus
Twitter - / blobinatic - เกม
I had my first maths lesson in class on graph theory a few hours after watching this video lmao
Lol I love how that happens. Some times I watch a TH-cam video on things I don't understand, and then learn about it or see it somewhere later that day
Really well made. Good video 👍
Cool video :) It's a really interesting topic
I really enjoyed this video from start to end!!!
Glad you enjoyed it!
Great video! Keep making videos the views will follow
Underrated video which deserves more likes and views
This video reminded me that I should probably try to find a devil's algorithm for the 2x2x3.
Really interesting and cool video :)
Thanks :D
Interesting video yo!
Glad you enjoyed
Do either a 1 hour long video of just learning algorithms or do a Mo3 with 5CF
more like a single 🤔🤔🤔
u deserve more views!!!
Thanks ❤️
Imagine if someone makes a world record by just trying the devils algorithm
Hmm I wonder if that would be against regulations or not lol
Can't find the link for the Hamiltonian circuit
Well Dave, riddle me this. Theoretically the devil's algorithm would pass every possible state of the cube once, right? Meaning that if you started on a solved could you would turn the cube exactly 43252003274489856000 before reaching the starting cube.
The devil’s algorithm itself does not need to pass through every cube state. It just needs to eventually when repeated enough times. A devil’s algorithm could theoretically be shorter than the number of states. Take the 180° restricted 2x2x2. It has 24 possible states, yet a devil’s algorithm for it is R2 U2 R2 U2 R2 B2 R2, only 7 moves long. So there might be one for 3x3x3 shorter than 43 quintillion!
Also my name is not Dave lol
@@RowanFortier hey dave
@@vaishaliwasnik2181 why 💀
@@RowanFortier 😁
I'd a friend who had a set pattern that he claimed could solve any scramble in 42 moves, he called it the "meaning of life" and after our math teacher did some calculations my friends pattern could easily solve 5% of all possible combinations, which isn't a lot until you figure out what 5 percent of 43 quintillion is
What is the algorithm
@@Psi_Fan123 unfortunately my friend took his algorithm to the grave after chemo failed
This video is criminally underrated
thanks :))
Anybody who doesn't like his work literally belongs in jail
34quadrillion moves with 1260 order
:yougotthis::yougotthis::washhands::washhands::washhands:
Okay let’s just pretend that ...ooh are there bloopers?
yay graph theory
What happened to the fast food review videos?
I’ve never made any fast food review videos lol
2 Ideas I got while watching the video:
Idea 1: There's currently a sorting algorythm that solves ANY unordered set of numbers in a fixed amount of moves. If we can extend such a set to 3 dimensions and extend the soting algorhythm too, we can translate the sorting moves into actual moves.
Idea 2: If idea 1 most likely doesn't work, perhaps we can work on a easier problem first, which is to try to find a way to solve the rubiks cube in 2 algorhythms instead of 1 first and then try to solve the original problem
These ideas are probably garbage though and I am no math expert
"These ideas are probably garbage though and I am no math expert"
Being a succesful math expert involves coming up with lots and lots of testable garbage ideas to get a feel for what might work, then stumble and fumble some more in the general right direction until you get lucky or being granted an epiphany. So that's that.
Your idea nr 1 is difficult to implement, because most sorting algorithms rely on being able to swap any two elements of the set at all times, which isn't possible on a cube where you're restricted to a small subset of permutations.
Idea nr. 2 is at least a perfectly reasonable plan to attack the problem, although to me it doesn't look all that promising or easy.
I study programming, I haven't heared of that algorithm, do you know what it's called? There exist algorithms that can sort in a fixed amount of time given unlimited computing resources, but those scale with the size of the set. There also exist fixed computing time sorts over a predetermined size of a set, however those rely on purpose built hardware rather then being an algorithm a general purpose computer (processor) could perform
@@DemonixTB Parallel Bitonic Merge Sort. It's slow but since we want to solve a cube with a non-changing algorhythm, I thought that could work
I got tricked by that dgcubing dude also Im the one from reddit
Isnt there the ribbon method and there was a solve with like 28 moves
The Ribbon Method is a method, but it is not the devil's algorithm
I thought a Devil's algorithm was impossible given that there is a quite low maximum possible length cycle. Hm. Maybe not.
Quick rant: There is a 2D analog of the 3x3, but it's not the floppy cube. That is unless you remove all the stickers from the large faces. You see, an N dimensional cube has N-1 dimensional faces. In the case of a 2D cube (i.e. square), the stickers are 1 dimensional, which could be represented by the edges of the floppy cube, if you imagine those 1D stickers being represented by some really thick lines. :-)
But the maximum possible lenght of a cycle just means that is you have a state of the cube x, which is represented by the class of equivalence of sequences of moves that turn the solved rubik cube into that state x, if you operate it with itself, that is, you applie over and over sequences of moves in that equivalence class, you will arrive to the solved state again in a limited ammount of repetitions. But, if the state is x and you applie a sequence of moves that it's not in it's class of equivalence, then that maximum does not applie.
Is the Hamiltonian circuit not an example of a devil's algorithm? The circuit visits every cube state, and so at some point visits the solved state. Assuming you're allowed to stop executing the devil's algorithm once you reach the solved state, I don't see why it wouldn't count?
the devil's algorithm would be shorter than the hamiltonian circuit. And repeating that algorithm would eventually bring any state to the solved state
@@RowanFortier Repeating the Hamiltonian circuit would eventually bring any state to the solved state. Is there an extra requirement of the devil's algorithm that it must be shorter than the optimal Hamiltonian circuit?
@@FEZfan repeating the Hamiltonian circuit would not bring it to the solved state. Doing the circuit would solve it at some point before the circuit ends. Yes A devils algorithm is shorter because you have to repeat it multiple times to maybe get to the solved state
10:37 yesss 😠😠 muhahahahahaha!!!!!!!!!!!!!!!
lol
It’s known now
I don’t think so, but if it is, I’d love to see it!
can i still say BC? even if you changed your name, it still works!
Yes lol
I'm a bit confused. By definition, a hamiltonian circuit can start in any state, pass through all states (including the solved state), and return to the original state. That implies that a hamiltionian circuit is equivalent to a devil's algorithm. However, in the video, you claim that a devil's algorithm for the 3x3 has not been found, and then later claim that a hamiltonian circuit *has* been found.
The hamiltonian circuit goes through every state without repeats and ends back where it starts. The devil's algorithm is like a shortcut for that. For the restricted 2x2x2, the hamiltonian is 24 moves, but the devil's alg is 7 moves long. We just haven't found one for 3x3x3 yet
@@RowanFortier i feel like a hamiltonian is a devils alg, just a longer version.
Did someone say "Family Legacy"?
What does that mean?
@@RowanFortier It means my family will find and eventually solve a cube using the Devils Algorithm.
Mark Zuckerberg or something idk
He looks super cute
😳😳😳
Yeah you do , just like superstar maheshbabu from south india ,you look like a younger version of him ❤️
@@RowanFortier sus
Ooooooooorrrrrrr,,…..
yOu CoUlD jUsT dO tWo MoVeS
Whose to say the devil doesn't have an insanely high TPS?
Imagine how 'warmed up' he'd always be 👹
43 quintillion algorithms so you mean every single move for every case of every single possible combinations, no kid that's not what an algorithm is.
Yeah. You could just memorize an algorithm to solve each of the 43 quintilion cases. The algorithms just go from wherever cube state you have to the solved state
What he meant was that there is exactly 1 algorithm that can solve exactly 1 solvable rubix cube. There are 43 quintillion possible solvable 3x3x3 stares so there are theoretically a maximum of 43 quintillion unique algorithms to solve any solvable 3x3x3 rubix cube.
There would be way less though. At least if god would be color neutral, he'd only have to memorize a 24th of them and even less if he learns the mirrored ones
1st HAHA