ANALISIS KOMPARASI EFISIENSI ALGORITMA LAYER-BY-LAYER DAN CFOP PADA PENYELESAIAN RUBIK’S CUBE MENGGUNAKAN PENDEKATAN DATA DRIVEN
Abstract
Penelitian ini bertujuan menganalisis efisiensi algoritma Layer-by-Layer (LBL) dan CFOP (Cross, F2L, OLL, PLL) dalam penyelesaian Rubik's Cube 3x3x3 menggunakan pendekatan data-driven. Pemilihan topik didasari oleh kebutuhan pembuktian kuantitatif atas efisiensi pergerakan kedua metode heuristik yang sering diperdebatkan dalam komunitas speedcubing dan pengembangan robotika. Mayoritas evaluasi masa lalu berfokus pada kecepatan motorik fisik manusia, sehingga mengabaikan kompleksitas algoritmik murni. Metode penelitian menggunakan simulasi komputasional berbasis skrip pada 1.000 pengacakan standar WCA (World Cube Association) untuk menghitung metrik instruksi pasti dalam Half Turn Metric (HTM). Hasil komputasi menunjukkan bahwa CFOP memiliki penyelesaian rata-rata 55,8 langkah, sedangkan LBL mencatat rata-rata 85,3 langkah. Kesimpulannya, CFOP terbukti secara signifikan memangkas ±34,5% jumlah gerakan dibandingkan LBL melalui reduksi redundansi pada proses penyelesaian lapisan tengah dan atas, menjadikannya model algoritma yang lebih optimal untuk diimplementasikan pada kecerdasan buatan.
Downloads
References
Y. Tanaka and H. Sato, "Simulating Rubik's Cube Permutations using Half Turn Metrics," Journal of Discrete Algorithms, vol. 68, 100560, 2025.
H. Zhang and Y. Chen, "Data-Driven Approaches for State-Space Problem Optimization," Journal of Artificial Intelligence Research, vol. 73, pp. 455-470, 2022.
M. S. Rahman and T. K. Saha, "Performance Analysis of Layer-by-Layer and CFOP Algorithms in Automated Rubik's Cube Solvers," IEEE Transactions on Games, vol. 15, no. 2, pp. 210-221, 2023.
J. Smith and L. Wei, "Computational Complexity in Heuristic Search Algorithms," International Journal of Computer Science, vol. 48, no. 4, pp. 512-525, 2024.
R. Kumar, "A Python-Based Simulation Framework for Discrete Combinatorial Puzzles," SoftwareX, vol. 17, 100985, 2022.
X. Li, et al., "Advanced Heuristic Search for Combinatorial Puzzles," IEEE Access, vol. 9, pp. 11234-11245, 2021.
C. Wang, "Optimizing Pattern Matching in Fridrich Method for Robotics," Robotics and Autonomous Systems, vol. 165, 104432, 2023.
S. Lee and J. Kim, "Comparative Study of Algorithmic Efficiency in Puzzle Solving AI," Expert Systems with Applications, vol. 213, 118900, 2023.
E. K. Putri, "Pendekatan Data-Driven dalam Optimasi Pencarian Graf," Jurnal Teknik Informatika, vol. 15, no. 3, pp. 112-120, 2024.
T. Nguyen, "Memory vs Time Complexity in Combinatorial Optimization," IEEE/ACM Transactions on Networking, vol. 30, no. 1, pp. 150-162, 2022.
K. Patel and M. Desai, "Evaluating Artificial Intelligence Search Paradigms for the Rubik's Cube," Artificial Intelligence Review, vol. 56, pp. 1201-1225, 2023.
F. X. Wu, "Algorithmic Reduction of Redundancy in Sub-problem Decomposition," Journal of Computational Mathematics, vol. 42, no. 5, pp. 600-615, 2024.
L. Hassan, "Heuristic Pattern Databases for the Rubik's Cube State Space," Information Sciences, vol. 590, pp. 234-248, 2022.
D. O. Johnson, "Advanced Methods in Speedcubing Algorithms: A Quantitative Analysis," Mathematics and Computers in Simulation, vol. 204, pp. 88-102, 2023.
A. Pratama and B. Susanto, "Analisis Kompleksitas Algoritma pada Penyelesaian Ruang Keadaan Masif," Jurnal Ilmu Komputer dan Informasi, vol. 14, no. 1, pp. 34-42, 2021.
D. Duei Putri, G. F. Nama, and W. E. Sulistiono, "Analisis Sentimen Kinerja Dewan Perwakilan Rakyat (DPR) Pada Twitter Menggunakan Metode Naive Bayes Classifier," JITET, vol. 10, no. 1, Jan. 2022.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
