Solving Sudoku with Ant Colony Optimisation
In this paper we present a new Ant Colony Optimisation-based algorithm for Sudoku, which out-performs existing methods on large instances. Our method includes a novel anti-stagnation operator, which we call Best Value Evaporation.
Code (2)
Similar Papers 제목 키워드 기반
ABCO: Adaptive Bacterial Colony Optimisation
This paper introduces a new optimisation algorithm, called Adaptive Bacterial Colony Optimisation (ABCO), modelled after the foraging behaviour of E. coli bacteria. The algorithm follows three stages--explore, exploit an…
100% accurate Sudoku solving with deep learning algorithm
A deep learning model capable of solving any Sudoku grid (so far). The model uses the Sudoku grid symmetry and it iteratively solves the grid filling digit step by step. A trial-and-error algorithm is also used if the m…
Deep LearningMaxSAT-Based Feedback for Guiding Vision-Language Models in Sudoku
Vision--Language Models (VLMs) have recently demonstrated promising performance on structured visual reasoning tasks, including grid-based puzzles. However, despite strong perceptual capabilities, these models lack expli…
Visual ReasoningFast-Spanning Ant Colony Optimisation (FaSACO) for Mobile Robot Coverage Path Planning
Coverage Path Planning (CPP) aims at finding an optimal path that covers the whole given space. Due to the NP-hard nature, CPP remains a challenging problem. Bio-inspired algorithms such as Ant Colony Optimisation (ACO) …
CPUExplaining Puzzle Solutions in Natural Language: An Exploratory Study on 6x6 Sudoku
The success of Large Language Models (LLMs) in human-AI collaborative decision-making hinges on their ability to provide trustworthy, gradual, and tailored explanations. Solving complex puzzles, such as Sudoku, offers a …
Decision Making