Abstract
This paper presents an investigation into utilizing circular swap mutations and partial brute forcing in guiding a stochastic search toward an optimal solution. The findings have potential implications for computational intelligence approaches in massive search spaces with known constraints. The efficacy of the method is examined using Sudoku puzzles ranging from 17 to 37 clues. The study graphically depicts the magnitude of the problem space, thus revealing the spatial proximity of states and the nature in which intertwined constraints affect the scope for locating a solution. These insights potentially assist in comprehending the problem space when designing solutions for vast, multidimensional problems. Constraint-aware circular swap mutations can serve as a successful strategy in the design of computational intelligence algorithms that need to be made capable of escaping local optima under temporal constraints. Future directions for research are also suggested. These include mathematically examining paths to optimal solutions and reverse-generating fitness landscapes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
McGuire G, Tugemann B, Civario G (2012) There is no 16-clue Sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration. Exper Math 23
D.A.P. (2013) Maximum number of clues in a sudoku game that does not produce a unique solution. Mathematics Stack Exchange https://math.stackexchange.com/q/345255, https://math.stackexchange.com/users/31718/daniel-a-a pelsmaeker (version: 2013-03-29)
Knuth DE (2000) Dancing links. Millennial Perspect Comput Sci 1:1–26
Johnston MD, Adorf HM (1989) Learning in stochastic neural networks for constraint satisfaction problems. In: Proceedings of the NASA conference on space telerobotics
Weber T (2005) A SAT-based Sudoku solver. In: Proceedings of the 12th international conference on logic for programming, artificial intelligence and reasoning, pp 11–15
Lewis R (2007) Metaheuristics can solve Sudoku puzzles. J Heuristics 13(4):387–401
Mantere T, Koljonen J (2008) Sudoku solving with cultural swarms. In: Proceedings of the 13th Finnish artificial intelligence conference (AI and machine consciousness), pp 60–67
Moraglio A, Togelius J (2007) Geometric particle swarm optimization for the Sudoku puzzle. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, New York, NY, USA, pp 118–125
Hereford JM, Gerlach H (2008) Integer-valued particle swarm optimization applied to Sudoku puzzles. In: Proceedings of the IEEE swarm intelligence symposium, pp 1–7
McGerty S (2009) Solving sudoku puzzles with particle swarm optimisation. Final Report, Macquarie University
Wang C, Sun B, Du KJ, Li JY, Zhan ZH, Jeon SW, Wang H, Zhang J (2023) A novel evolutionary algorithm with column and sub-block local search for sudoku puzzles. IEEE Trans Games
Nicolau M, Ryan C (2006) Solving Sudoku with the GAuGE system. In: Collet P, Tomassini M, Ebner M, Gustafson S, Ekárt A (eds) Genetic programming. Springer, Berlin, Heidelberg, pp 213–224
Abdel-Raouf O, Abdel-Baset M, Henawy I (2014) A novel hybrid flower pollination algorithm with chaotic harmony search for solving Sudoku puzzles. Int J Eng Trends Technol 7:126–132
Pillay N (2012) Finding solutions to Sudoku puzzles using human intuitive heuristics. South African Comput J 49:25–34
Becker M, Balci S (2018) Improving an evolutionary approach to sudoku puzzles by intermediate optimization of the population. In: International conference on information science and applications. Springer, pp 369–375
Jones S, Roach P, Perkins S (2007) Construction of heuristics for a search-based approach to solving Sudoku. In: Proceedings of the 27th SGAI international conference on artificial intelligence. Cambridge, England, pp 37–49
Mcgerty S, Moisiadis F (2014) Are evolutionary algorithms required to solve Sudoku problems? Comput Sci Inf Technol 4:365–377
Ipe NK, Chatterjee S (2022) An in-memory physics environment as a world model for robot motion planning. In: Soft computing: theories and applications: proceedings of SoCTA 2020, vol 1. Springer, pp 559–569
Ipe NK (2021) The need to visualize sudoku, preprint at https://engrxiv.org/preprint/view/1649/
Ipe N, Kulkarni RV (2021) The need to visualize Sudoku, preprint at https://www.techrxiv.org/articles/preprint/The_Need_To_Visualize_Sudoku/14528928
Park K (2016) 1 million sudoku games. https://www.kaggle.com/bryanpark/sudoku
Cao Y (2008) Benchmarking Sudoku solvers. https://in.mathworks.com/matlabcentral/fileexchange/18921-benchmarking-sudoku-solvers
Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul (TOMACS) 8(1):3–30
McGrath R. The GNU C library (GLIBC). https://www.gnu.org/software/libc/
Pelanek R et al (2011) Difficulty rating of sudoku puzzles by a computational model. In: FLAIRS conference. Citeseer
Ercsey-Ravasz M, Toroczkai Z (2012) The chaos within Sudoku. Sci Rep 2:1–8
Inkala A. AI sudoku puzzle difficulty. http://www.aisudoku.com/index_en.html
Rusu RB, Cousins S (2011) 3D is here: point cloud library (PCL). In: 2011 IEEE international conference on robotics and automation. IEEE, pp 1–4
Girardeau-Montaut D. Cloud compare. https://www.danielgm.net/cc/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ipe, N.K., Kulkarni, R.V. (2024). Visualizing and Exploring the Dynamics of Optimization via Circular Swap Mutations in Constraint-Based Problem Spaces. In: Kumar, S., K., B., Kim, J.H., Bansal, J.C. (eds) Fourth Congress on Intelligent Systems. CIS 2023. Lecture Notes in Networks and Systems, vol 868. Springer, Singapore. https://doi.org/10.1007/978-981-99-9037-5_10
Download citation
DOI: https://doi.org/10.1007/978-981-99-9037-5_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-9036-8
Online ISBN: 978-981-99-9037-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)