Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem

Abstract

The research tackled artificial intelligent methods to solve one of the optimization problems by using artificial ant by applying ant colony optimization algorithm and also tabu search algorithm to find the solution of sliding tile 8-puzzel problem. In ant colony algorithm generated many possible solutions depending on finding the difference tiles in initial state from the goal and moving accordingly in the current state of the problem. In Tabu search, many possible solutions have been generated according to the replacement relation between different tiles in initial state to find the optimal solution from many solutions. In this research, the experimental show is very speed to obtain the goal. The source code is written in MATLAB language to simulate these two algorithms.

Establishing a cyclic schedule for nurse in the health unit

“…A game consists of a starting position and a goal position that is assigned. The sliding tile puzzle, which features n tiles numbered from 1 to n and one blank tile in a square grid, is also called the n-puzzle [23]. Sudoku grid is a popular problem of combinatorial optimization and is known as Np-complete.…”