{"id":20609355,"url":"https://github.com/isparshp/rubiks-cube-solver","last_synced_at":"2025-09-26T11:30:55.997Z","repository":{"id":231529497,"uuid":"705856660","full_name":"iSparshP/Rubiks-Cube-Solver","owner":"iSparshP","description":"Welcome to the C++ Rubik's Cube Solver project, a powerful and efficient solution to conquer the classic Rubik's Cube puzzle. This open-source C++ project provides a user-friendly interface and robust solving algorithms, making it the perfect tool for both beginners and experienced cubers. ","archived":false,"fork":false,"pushed_at":"2024-04-05T17:56:28.000Z","size":98,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-11-16T10:13:50.095Z","etag":null,"topics":["c","clion","cmake","cpp","stl"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/iSparshP.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-10-16T20:31:47.000Z","updated_at":"2024-10-29T17:01:17.000Z","dependencies_parsed_at":"2024-04-04T14:02:48.281Z","dependency_job_id":"6b6d692a-97fc-4cf6-94bb-66778595677e","html_url":"https://github.com/iSparshP/Rubiks-Cube-Solver","commit_stats":null,"previous_names":["isparshp/rubiks-cube-solver"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iSparshP%2FRubiks-Cube-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iSparshP%2FRubiks-Cube-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iSparshP%2FRubiks-Cube-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iSparshP%2FRubiks-Cube-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/iSparshP","download_url":"https://codeload.github.com/iSparshP/Rubiks-Cube-Solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":234304869,"owners_count":18811269,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","clion","cmake","cpp","stl"],"created_at":"2024-11-16T10:13:21.914Z","updated_at":"2025-09-26T11:30:50.739Z","avatar_url":"https://github.com/iSparshP.png","language":"C++","readme":"# Rubik's Cube Solver\n\n\n![rubiks](https://github.com/iSparshP/Rubiks-Cube-Solver/assets/77487266/86ad7bae-9fad-4761-9586-af8a2adf3fa9)\n\n\nWelcome to the Rubik's Cube Solver project! This solver is designed to tackle one of the world's most iconic puzzles, the Rubik's Cube, using Richard Korf's Iterative Deepening A* (IDA*) algorithm. Whether you're a seasoned cube enthusiast or a beginner, this tool will help you conquer the challenge and unravel the mysteries of the cube.\n\n\n## Table of Contents\n\n- [Rubik's Cube Solver](#rubiks-cube-solver)\n  - [Table of Contents](#table-of-contents)\n  - [Introduction](#introduction)\n  - [Features](#features)\n  - [Getting Started](#getting-started)\n  - [Algorithm Overview](#algorithm-overview)\n  - [Contributing](#contributing)\n  - [License](#license)\n\n\n## Introduction\n\nThe Rubik's Cube has captivated minds for decades with its mesmerizing complexity. Solving it can be a daunting task, especially for more intricate cube configurations. Our project aims to simplify this process by harnessing the power of Richard Korf's IDA* algorithm, renowned for its efficiency in solving puzzles with vast state spaces.\n\n\n## Features\n\n- **IDA* Algorithm**: Our solver is built around Korf's IDA* algorithm, a memory-efficient and effective method for finding optimal solutions to the Rubik's Cube.\n\n- **Interactive Interface**: Enjoy a user-friendly command-line interface that allows easy input and manipulation of your Rubik's Cube configuration.\n\n- **Customizable**: Tailor the solving process to your needs by configuring various parameters, including the maximum depth limit and heuristic functions.\n\n- **Optimal Solutions**: Rest assured that our solver will find the optimal solution for your Rubik's Cube, minimizing the number of moves required.\n\n- **Step-by-Step Visualization**: Visualize the solution step by step, gaining a deeper understanding of the solving process.\n\n\n## Getting Started\n\nTo get started with the Rubik's Cube Solver, follow these simple steps:\n\n\n1. **Clone the Repository**:\n   ```bash\n   git clone https://github.com/iSparshP/Rubiks-Cube-Solver.git\n   ```\n\n2. **Build the Project**:\n   - Open the project in CLion IDE.\n   - Configure the CMake settings according to your system.\n   - Build the project using the IDE's build functionality.\n\n3. **Run the Solver**:\n   - Open the terminal in CLion IDE.\n   - Navigate to the project directory.\n   - Run the solver executable generated by the build process.\n\n4. **Enjoy Solving!**:\n   - Follow the on-screen instructions to input and manipulate your Rubik's Cube configuration.\n   - Let the solver find the optimal solution for you.\n   - Visualize the solution step by step for a deeper understanding of the solving process.\n\n## Algorithm Overview\nThe Rubik's Cube Solver utilizes Richard Korf's Iterative Deepening A* (IDA*) algorithm to find the optimal solution for the Rubik's Cube. IDA* is a memory-efficient and effective method for solving puzzles with vast state spaces. It combines depth-first search with heuristic evaluation to efficiently explore the solution space and find the shortest path to the goal state.\n\n## Contributing\nContributions to the Rubik's Cube Solver project are welcome! If you have any ideas, suggestions, or bug reports, please open an issue or submit a pull request. We appreciate your contributions and strive to make this project as robust and user-friendly as possible.\n\n## License\nThis project is licensed under the MIT License. See the [LICENSE](LICENSE) file for more details.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fisparshp%2Frubiks-cube-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fisparshp%2Frubiks-cube-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fisparshp%2Frubiks-cube-solver/lists"}