Name
Abstract | ||
|---|---|---|
The n-queens problem is solved with Boltzmann machines and a depth-first search (DFS) algorithm. In large-scale problems, the Boltzmann machines found a solution much faster than the DFS. The 1000-queens problem was solved using an energy minimization technique. The polyomino puzzles were also solved with Boltzman machines and a DFS algorithm. In small-scale problems, the DFS solved these puzzles faster than Boltzmann machines. Using Gaussian machines, large-size polyomino puzzles were solved successfully. For example, 36 unique solutions were obtained for the 1000-queens problem, and 5×8, 6×10, and 8×8 sized difficult polyomino puzzles were solved |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/TAI.1989.65368 | Fairfax, VA |
Keywords | Field | DocType |
minimisation,neural nets,problem solving,search problems,boltzmann machines,gaussian machines,depth first search algorithm,energy minimization technique,large scale puzzles,n-queens problem,neural networks,polyomino puzzles,n queens problem,concurrent computing,artificial neural networks,neural network,artificial intelligence,high performance computing,probability,depth first search,computer networks,boltzmann machine,energy minimization | Distributed File System,Computer science,Depth-first search,Polyomino,Algorithm,Minimisation (psychology),Gaussian,Boltzmann constant,Artificial neural network,Energy minimization | Conference |
Citations | PageRank | References |
8 | 1.23 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masahiro Kajiura | 1 | 31 | 5.95 |
| Yutaka Akiyama | 2 | 172 | 37.62 |
| Yuichiro Anzai | 3 | 244 | 40.11 |