https://github.com/rtinter/n_queen_a_star_search

n_queen problem solution via A star search
https://github.com/rtinter/n_queen_a_star_search

Last synced: 18 days ago
JSON representation

n_queen problem solution via A star search

• Host: GitHub
• URL: https://github.com/rtinter/n_queen_a_star_search
• Owner: rtinter
• Created: 2023-10-18T11:27:46.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-10-18T11:31:35.000Z (over 2 years ago)
• Last Synced: 2025-11-18T03:09:04.950Z (8 months ago)
• Language: Python
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# n_queen_A_Star_Search

n_queen problem solution via A* search

type in the number of queens and the field will be generated accordingly.

The steps from node to node will be printed, as well as the f value,

which contains:

g(n) = cost for moving up or down with the value of 1 per step

h(n) = number of Queens that attack each other.