Universidad Simón Bolívar • Algorithms
An optimal-path solver for the Rubik’s Cube
A C++ implementation of A* search developed under demanding time and memory constraints as an academic algorithms project.
Challenge
The state space of a Rubik’s Cube is extremely large. Finding optimal solution paths required careful management of both execution time and memory usage.
Contribution
I implemented the solver in C++ using the A* search algorithm, then iterated through optimization, testing, and refactoring to improve its performance and reliability.
Outcome
The finished academic project produced a robust optimal-path solution while demonstrating practical work with search algorithms, heuristics, and resource constraints.