Skip to content

Algorithm to check if 2 chess problems have a unique solution while exploring rotations and flipping along the axes.

Notifications You must be signed in to change notification settings

Praneeth003/Chess-Board-Positions-Equivalence

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 

Repository files navigation

• Engaged in an ongoing research collaboration with a professor in the university and implemented an algorithm to check if 2 chess problems are equivalent and therefore have a unique solution.

• Explored rotations and flipping along the axes to obtain different possible chessboard positions in checking the equivalence by using NumPy library of python.

About

Algorithm to check if 2 chess problems have a unique solution while exploring rotations and flipping along the axes.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages