Skip to content

tanbuinhat/8queens_Heuristic-Calculation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

Repository files navigation

8queens_Heuristic-Calculation

Given an 8x8 chess board, on which 8 queens are available in any 8 positions with the constraint that each column has at least one queen. For example, as shown below.

Screen Shot 2021-03-17 at 20 35 15

Heuristic function h (x) is defined as the number of queens that can attack each other, directly or indirectly. For example, the upper left state h (x) = 17, the right state has h (x) = 1.

Requirements: With the given state as above of the chess board. Calculate the value of the function h (x) in the cells of the matrix when moving the queens to that position. Know that in any state of the board, queens can be moved vertically from the position where they are standing.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages