Markov chains with Rubik's cubes
The Rubik's cube is a model for a planning issue that has a huge state space and a single solution. It embodies the phrase "needle in a haystack" perfectly. Without assistance, you may spend the rest of the universe failing, even if you could turn the faces 100 times each second. There seems to be a tremendous number involved in everything.
The amount we will compute in this case is an exception to that rule. With it, you may easily understand a complex problem (and any other planning challenge that is comparable to it, too). An optimal solver and a random process are the two things we require. This final item is a tool (actual or hypothetical) for solving the rubix cube.
0 Comments