A Novel Evolutionary Algorithm With Column and Sub-Block Local Search for Sudoku Puzzles

C Wang, B Sun, KJ Du, JY Li, ZH Zhan… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
Sudoku puzzles are not only popular intellectual games but also NP-hard combinatorial
problems related to various real-world applications, which have attracted much attention …

A Dataset of Sudoku Puzzles with Difficulty Metrics Experienced by Human Players

SW Wang - IEEE Access, 2024 - ieeexplore.ieee.org
Sudoku is a popular logic-based puzzle game. Difficulty rating of a Sudoku puzzle is a
difficult problem and a large number of research works have been proposed to tackle the …

Improved ant colony genetic algorithm hybrid for sudoku solving

T Mantere - 2013 Third World Congress on Information and …, 2013 - ieeexplore.ieee.org
In this paper we introduce our new improved version of ant colony optimization/genetic
algorithm hybrid for Sudoku puzzle solving. Sudoku is combinatorial number puzzle that had …

Solving Sudoku puzzles using evolutionary techniques—a systematic survey

DB Mishra, R Mishra, KN Das, AA Acharya - Soft Computing: Theories and …, 2018 - Springer
Sudoku puzzle is a game which takes the form of an N× N matrix. It requires the players to
organize the number sequences from 1 to N in the submatrices of the original matrix in such …

A Genetic Algorithm for Solving Sudoku Based on Multi-Armed Bandit Selection

JL Kim, E Eor - IEEE Transactions on Games, 2024 - ieeexplore.ieee.org
In this paper, we introduce a Genetic Algorithm based Upper Confidence Bound (GA-UCB),
an innovative hybrid genetic algorithm integrating Multi-Armed Bandit (MAB). It effectively …

Automating Tower Defense Game Level Design with Evolutionary Algorithms

W Wattanapornprom, C Satsuk… - 2024 28th …, 2024 - ieeexplore.ieee.org
This paper explores the use of Genetic Algorithms (GA) and Customized Estimation of
Distribution Algorithms (CEDA) to dynamically design enemy waves in a Tower Defense …

Application of estimation of distribution algorithms for solving order acceptance with weighted tardiness problems

W Wattanapornprom, T Li… - 2013 IEEE …, 2013 - ieeexplore.ieee.org
Over the past decade the strategic importance of order acceptance has been widely
recognized in practice. This research studies the adaptation of estimation of distribution …

[图书][B] Minimizing Makespan Using Node Based Coincidence Algorithm in the Permutation Flowshop Scheduling Problem

O Srimongkolkul, P Chongstitvatana - 2015 - Springer
This paper proposes a Node-Based Coincidence Algorithm (NB-COIN) for the permutation
flowshop scheduling problems (PFSP) aimed at Makespan minimization. For almost half a …

Application of node based estimation of distribution algorithms for solving order acceptance with capacity balancing problems by trading off between over capacity and …

W Wattanapornprom, T Li… - 2014 International …, 2014 - ieeexplore.ieee.org
Order acceptance with capacity balance problems require trading off between over and
under capacity utilization in order to gain more profits. This research proposes a new over …

Application of Node Based Coincidence Algorithm for Solving Order Acceptance with Multi-process Capacity Balancing Problems

W Wattanapornprom, T Li… - Future Information …, 2015 - api.taylorfrancis.com
Over the past decade the strategic importance of order acceptance has been widely
recognized in practice. This paper presents the application of node based coincidence …