Anbulagan and Winata, Norman (2000) Penyelesaian Masalah N-Ratu dengan Algoritma Backtracking dan Heuristik Forward Checking.
Full text not available from this repository.Abstract
N-Queens problem is a part of Constraint Satisfaction Problems (CSPs). CSP plays an important role in Artificial Intelligence (AI). The N-Queens problem is a classical combinatorial problem. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving strategies. Recently, the problem has found practical applications in VLSI testing and traffic control. Due to its inherent complexity, currently even very efficient AI search algorithms developed so far can only find a solution, the first one, for the N-Queens problem with N up to 100. The paper present an algorithm used to solve the N-Queens problem which is based on backtracking and forward checking. Our algorithm is capable of finding the first solution for N up to 120 in less than one minute.
| Item Type: | Article |
|---|---|
| Subjects: | Collections > Koleksi Perpustakaan Di Indonesia > Perpustakaan Di Indonesia > JKPTBINUS > Journal > BiNus Jurnal > Vol 8 No 1 April 2000 |
| Divisions: | Universitas Komputer Indonesia > Perpustakaan UNIKOM |
| Depositing User: | Admin Repository |
| Date Deposited: | 16 Nov 2016 07:35 |
| Last Modified: | 16 Nov 2016 07:35 |
| URI: | http://repository.unikom.ac.id/id/eprint/959 |
Actions (login required)
 |
View Item |
