A maximum neural network approach for N-queens problems

Nobuo Funabiki, Yoichi Takenaka, Seishi Nishikawa

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N × N chessboard such that no pair of queens commands each other. The maximum rjeuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N2-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks.

Original languageEnglish
Pages (from-to)251-255
Number of pages5
JournalBiological Cybernetics
Volume76
Issue number4
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Neural networks
Neurons
Constraint satisfaction problems

ASJC Scopus subject areas

  • Biophysics

Cite this

Funabiki, N., Takenaka, Y., & Nishikawa, S. (1997). A maximum neural network approach for N-queens problems. Biological Cybernetics, 76(4), 251-255.

A maximum neural network approach for N-queens problems. / Funabiki, Nobuo; Takenaka, Yoichi; Nishikawa, Seishi.

In: Biological Cybernetics, Vol. 76, No. 4, 1997, p. 251-255.

Research output: Contribution to journalArticle

Funabiki, N, Takenaka, Y & Nishikawa, S 1997, 'A maximum neural network approach for N-queens problems', Biological Cybernetics, vol. 76, no. 4, pp. 251-255.
Funabiki, Nobuo ; Takenaka, Yoichi ; Nishikawa, Seishi. / A maximum neural network approach for N-queens problems. In: Biological Cybernetics. 1997 ; Vol. 76, No. 4. pp. 251-255.
@article{4234458bc09445ad84f0ddf93e4d0f9f,
title = "A maximum neural network approach for N-queens problems",
abstract = "A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N × N chessboard such that no pair of queens commands each other. The maximum rjeuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N2-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks.",
author = "Nobuo Funabiki and Yoichi Takenaka and Seishi Nishikawa",
year = "1997",
language = "English",
volume = "76",
pages = "251--255",
journal = "Biological Cybernetics",
issn = "0340-1200",
publisher = "Springer Verlag",
number = "4",

}

TY - JOUR

T1 - A maximum neural network approach for N-queens problems

AU - Funabiki, Nobuo

AU - Takenaka, Yoichi

AU - Nishikawa, Seishi

PY - 1997

Y1 - 1997

N2 - A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N × N chessboard such that no pair of queens commands each other. The maximum rjeuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N2-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks.

AB - A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N × N chessboard such that no pair of queens commands each other. The maximum rjeuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N2-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks.

UR - http://www.scopus.com/inward/record.url?scp=0000055318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000055318&partnerID=8YFLogxK

M3 - Article

VL - 76

SP - 251

EP - 255

JO - Biological Cybernetics

JF - Biological Cybernetics

SN - 0340-1200

IS - 4

ER -