SudoSLVRR: A Multithreaded Multi-Colony Ant Optimization with Ring and Random Communication Topologies as Sudoku Solver

This dataset contains the instances used to test the SudoSLVRR algorithm, a framework that integrates constraint propagation and multi-colony ant optimization with dynamic collaborative mechanism in each thread. The dataset comprises 30 total Sudoku puzzle instances divided into three complexity scales to test algorithm scalability and performance: Order 3 (9x9 grids): 10 instances Order 4 (16x16 grids): 10 instances Order 5 (25x25 grids): 10 instances