AIMay 9, 2018

Solving Sudoku with Ant Colony Optimisation

arXiv:1805.03545v127 citations
AI Analysis

This is an incremental improvement for solving Sudoku puzzles, primarily relevant to puzzle-solving and optimization communities.

The authors tackled solving Sudoku puzzles using a new Ant Colony Optimisation algorithm, which outperforms existing methods on large instances by incorporating a novel anti-stagnation operator called Best Value Evaporation.

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 Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes