[1] Afriyudi, Anggoro Suryo Pramudyo, and M. Akbar, “Penyelesaian Puzzle Sudoku menggunakan Algoritma Genetik,” 2008, doi:
10.13140/RG.2.1.4921.6726.
[2] A. K. Maji and R. K. Pal, “Sudoku solver using minigrid based backtracking,”
in 2014 IEEE International Advance Computing Conference (IACC), Gurgaon, India, Feb. 2014, pp. 36–44, doi: 10.1109/IAdCC.2014.6779291.
[3] A. Milton and C. Ortega-Sanchez, “Development and analysis of genetic algorithms: Sudoku case study,” in TENCON 2012 IEEE Region 10 Conference, Cebu, Philippines, Nov. 2012, pp. 1–6, doi:
10.1109/TENCON.2012.6412205.
[4] A. Yusuf and H. Hendra, “Penyelesaian Puzzle Sudoku Menggunakan Algoritma Brute Force Dan Backtracking,” Jurnal Techno Nusa Mandiri, vol.
10, no. 2, Art. no. 2, Sep. 2013.
[5] B. H. Arabi, “Solving NP-complete Problems Using Genetic Algorithms,” in 2016 UKSim-AMSS 18th International Conference on Computer Modelling and Simulation (UKSim), Cambridge, United Kingdom, Apr. 2016, pp. 43–48, doi: 10.1109/UKSim.2016.65.
[6] D. I. R. Munir, “Teori P, NP, dan NP-Complete,” Bahan Kuliah IF2211 Strategi Algoritma Program Studi Teknik Informatika ITB, p. 36, 2018.
[7] D. J. M. Weiss, “Genetic Algorithms and Sudoku,” Midwest Instruction and Computing Symposium, vol. 1, no. 4 April 2009, p. 9, 2009.
[8] D. Job and V. Paul, “Recursive Backtracking for Solving 9*9 Sudoku Puzzle,”
BIJDM, vol. 6, no. 1, pp. 07–09, Jan. 2016, doi: 10.9756/BIJDM.8128.
[9] E. Martiana, “Introduction to Artificial Intelligence,” Introduction to Artificial Intelligence Entin Martiana IT-EEPIS, 2013. https://docplayer.info/32797890-Entin-martiana-it-eepis.html (accessed Feb. 16, 2021).
[10] E. Utami, J. Istiyanto, and S. Raharjo, Metodologi Penelitian Pada Ilmu Komputer. Yogyakarta,: Seminar Nasional Teknologi 2007 (SNT 2007), 2007.
51
[11] F. F. Coastera, Ernawati, and A. Nomansa, “Implementasi Algoritma Backtracking Pada Aplikasi Permainan Tradisional Dam-Daman Berbasis Java Desktop,” Informatics Study Program. Universitas Bengkulu, pp. 1–10, 2016.
[12] F. Gerges, G. Zouein, and D. Azar, “Genetic Algorithms with Local Optima Handling to Solve Sudoku Puzzles,” in Proceedings of the 2018 International Conference on Computing and Artificial Intelligence - ICCAI 2018, Chengdu, China, 2018, pp. 19–22, doi: 10.1145/3194452.3194463.
[13] G. Chitranshi, S. Tiwari, R. Singh, and P. S. Sengar, “Neural Network Based Skeleton Recognition and Sudoku Solving,” in 2016 3rd International Conference on Signal Processing and Integrated Networks (SPIN), Noida, Delhi NCR, India, Feb. 2016, pp. 691–693, doi: 10.1109/SPIN.2016.7566785.
[14] G. Ytrestøl, “Optimistic Backtracking - A Backtracking Overlay for Deterministic Incremental Parsing,” in Proceedings of the ACL 2011 Student Session, Portland, OR, USA, Jun. 2011, pp. 58–63, Accessed: Feb. 15, 2021.
[Online]. Available: https://www.aclweb.org/anthology/P11-3011.
[15] Herimanto, P. Sitorus, and E. M. Zamzami, “An Implementation of Backtracking Algorithm for Solving A Sudoku-Puzzle Based on Android,” J.
Phys.: Conf. Ser., vol. 1566, p. 012038, Jun. 2020, doi: 10.1088/1742-6596/1566/1/012038.
[16] H. Chel, D. Mylavarapu, and D. Sharma, “A novel multistage genetic algorithm approach for solving Sudoku puzzle,” in 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), Chennai, India, Mar. 2016, pp. 808–813, doi:
10.1109/ICEEOT.2016.7754798.
[17] J. Hadinata, “Problem Solving Sudoku Menggunakan Algoritma Genetika,”
Sisfotenika, vol. 1, no. 1, Art. no. 1, 2011, doi: 10.30700/jst.v1i1.6.
[18] K. De Jong, J. William, and W. Spears, “Using Genetic Algorithms to Solve NP-Complete Problems,” Proceedings Of The Third International Conference On Genetic Algorithms, vol. 3, pp. 124–132, Jul. 1998.
[19] K. D. Atmojo, “Penerapan Algoritma DFS pada Permainan Sudoku Dengan Backtracking.” Institut Teknologi Bandung, 2012, Accessed: Feb. 12, 2021.
[Online]. Available:
https://informatika.stei.itb.ac.id/~rinaldi.munir/Stmik/2012-2013/Makalah2012/Makalah-IF3051-2012-082.pdf.
[20] K. Das, S. Bhatia, and S. Puri, “A Retrievable GA for Solving Sudoku Puzzles A Retrievable GA for Solving Sudoku Puzzles,” Feb. 2021.
[21] M. F. Wahyudipraja, “Algoritma Backtracking: Diajukan sebagai tugas kelompok mata kuliah Analisis Algoritma,” Scribd.
https://id.scribd.com/document/342178865/Backtracking-Algorithm-docx (accessed Feb. 14, 2021).
[22] M. Hindi and R. Yampolskiy, “Genetic Algorithm Applied to the Graph Coloring Problem,” Midwest Artificial Intelligence and Cognitive Science Conference, p. 60, Jan. 2012.
[23] M. Mitchell, An introduction to genetic algorithms, 7. print. Cambridge, Mass., 1999.
[24] M. Nicolau and C. Ryan, “Solving Sudoku with the GAuGE System,” in Genetic Programming, vol. 3905, P. Collet, M. Tomassini, M. Ebner, S.
Gustafson, and A. Ekárt, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 213–224.
[25] M. Schottlender, “The effect of guess choices on the efficiency of a backtracking algorithm in a Sudoku solver,” in IEEE Long Island Systems, Applications and Technology (LISAT) Conference 2014, Farmingdale, NY, USA, May 2014, pp. 1–6, doi: 10.1109/LISAT.2014.6845190.
[26] N. A. Hasanah, L. Atikah, D. Herumurti, and A. A. Yunanto, “A Comparative Study: Ant Colony Optimization Algorithm and Backtracking Algorithm for Sudoku Game,” in 2020 International Seminar on Application for Technology of Information and Communication (iSemantic), Semarang, Indonesia, Sep.
2020, pp. 548–553, doi: 10.1109/iSemantic50169.2020.9234267.
[27] N. Thirer, “About the FPGA implementation of a genetic algorithm for solving Sudoku puzzles,” in 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, Eilat, Israel, Nov. 2012, pp. 1–3, doi:
10.1109/EEEI.2012.6377058.
[28] R. Adhitia, “Penyelesaian Permainan Sudoku Dengan Algoritma Bruteforce Backtracking Dan Backtracking Dengan Optimasi,” Informatics Study Program. Institut Teknologi Bandung, pp. 1–6, 2007.
53
[29] R. C. Wihandika, N. R. Mubtada’i, and R. Y. Hakku, “Penyelesaian Puzzle Sudoku Menggunakan Algoritma Genetika,” EEPIS Final Project, 2011, Accessed: Feb. 16, 2021. [Online]. Available: http://www.eepis-its.edu.
[30] R. D. I. Sari, “Analisis Penyelesaian Puzzle Sudoku Dengan Menerapkan Algoritma Backtracking,” Prosiding Konferensi Nasional “Inovasi dalam Desain dan Teknologi” ‐ IDeaTech 2011, no. 2011, p. 14, 2011.
[31] R. Munir, “Algoritma Runut-Balik (Backtracking),” Course Hero, Dec. 01, 2017. https://www.coursehero.com/file/22272518/Algoritma-Runut-balik/
(accessed Feb. 16, 2021).
[32] S. Jana, A. K. Maji, and R. K. Pal, “A novel Sudoku solving technique using column based permutation,” in 2015 International Symposium on Advanced Computing and Communication (ISACC), Silchar, India, Sep. 2015, pp. 71–77, doi: 10.1109/ISACC.2015.7377318.
[33] S. Kamal, S. S. Chawla, and N. Goel, “Detection of Sudoku puzzle using image processing and solving by Backtracking, Simulated Annealing and Genetic Algorithms: A comparative analysis,” in 2015 Third International Conference on Image Information Processing (ICIIP), Waknaghat, India, Dec.
2015, pp. 179–184, doi: 10.1109/ICIIP.2015.7414762.
[34] S. M. Kazemi and Bahare Fatemi, “A Retrievable Genetic Algorithm For Efficient Solving Of Sudoku Puzzles,” Apr. 2014, doi:
10.5281/ZENODO.1092323.
[35] S. Mujaddid, “Penerapan Algoritma Runut-Balik (Backtracking) Dalam Penyelesaian Permainan Sudoku,” Institut Teknologi Bandung, no. 2010, p. 5, 2006.
[36] T. H. Cormen, Ed., Introduction to algorithms, 3rd ed. Cambridge, Mass: MIT Press, 2009.
[37] T. Mantere and J. Koljonen, “Solving, rating and generating Sudoku puzzles with GA,” in 2007 IEEE Congress on Evolutionary Computation, Singapore, Sep. 2007, pp. 1382–1389, doi: 10.1109/CEC.2007.4424632.
[38] T. Mantere, “Improved ant colony genetic algorithm hybrid for Sudoku solving,” in 2013 Third World Congress on Information and Communication Technologies (WICT 2013), Hanoi, Vietnam, Dec. 2013, pp. 274–279, doi:
10.1109/WICT.2013.7113148.
[39] V. S. Widjaja and D. Z. Sudirman, “Implementasi Algoritma Backtracking Dengan Optimasi Menggunakan Teknik Hidden Single Pada Penyelesaian Permainan Sudoku,” p. 5, 2013.
[40] X. Q. Deng and Y. D. Li, “A novel hybrid genetic algorithm for solving Sudoku puzzles,” Optim Lett, vol. 7, no. 2, pp. 241–257, Feb. 2013, doi:
10.1007/s11590-011-0413-0.
[41] Y. Sato and H. Inoue, “Solving Sudoku with genetic operations that preserve building blocks,” in Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, Copenhagen, Denmark, Aug. 2010, pp. 23–29, doi: 10.1109/ITW.2010.5593375.
[42] Y. S. Rgp, D. Narapratama, and A. A. Salim, “Analisis Beberapa Algoritma Untuk Menyelesaikan Puzzle Sudoku,” Laboratorium Ilmu dan Rekayasa Komputasi Departemen Teknik Informatika, Institut Teknologi Bandung, vol.
53, no. 2006, p. 3, 2006.
[43] Yusfrizal, “Penerapan Algoritma Genetika Sebagai Problem Solver Dalam Game Sudoku Berbasis Android,” Seminar Nasional Informatika (SNIf), vol.
1, no. 1, Art. no. 1, Nov. 2017.
[44] W. Geem, “Harmony Search Algorithm for Solving Sudoku,” in Knowledge-Based Intelligent Information and Engineering Systems, vol. 4692, B.
Apolloni, R. J. Howlett, and L. Jain, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 371–378