Skip to content

leonart-delux/placing-queens

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 

Repository files navigation

8 QUEENS PUZZLE

1. General

This is just a tiny code which applys:

  • Hill Climbing Search
  • Beam Search

In order to solve 8 queens puzzle.

Heuristic value I use is number of facing queen pairs (regardless of whether there is a queen in the middle or not).

2. Version info:

This project is built on python 3.13.0.

You should already have Tkinter to run my code.

pip install tkinter

About

HCMUTE - AI course

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages