🎮 Rubik's Cube Solver

This is a Rubik's Cube solver that demonstrates the use of the IDA* algorithm to find the optimal solution of a valid randomly shuffled Rubik's Cube in under 11 seconds. ⏳

---

✨ Demonstration of the Solver in Action

Here is a demonstration of the solver applied to a Rubik's Cube shuffled 6 times:

✅ DFS Solver

✅ The DFS solver with a max depth of 7 performs well but does not always provide an optimal solution.

---

✅ IDDFS Solver

✅ The IDDFS solver finds an optimal solution in a time comparable to DFS.

---

✅ IDA Solver*

✅ The IDA* solver also provides an optimal solution within a similar time frame as DFS and IDDFS.

---

⚠️ Note:

• The Rubik's Cube is shuffled randomly before solving.
• There are cases where the DFS solver fails to find a solution within the allowed max depth.
• The IDDFS and IDA* algorithms consistently produce optimal results in less than 11 seconds. ⏳✨🎮

---

📜 Reference

This project is based on the research paper:🔗 "Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases" by Richard Korf.