Using genetic algorithm for solving N-Queens problem
The N-Queens problem is a well-known NP-Hard problem. Optimal solutions to small N values can be found in reasonable time by classical search algorithms or linear programming. However, since the N-Queens problem is a constraint satisfaction problem (CSP), it will be very time consuming to solve larg...
保存先:
| 主要な著者: | , |
|---|---|
| その他の著者: | |
| フォーマット: | Conference paper |
| 出版事項: |
2023
|
| 主題: | |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|