This code intends to find the maximum number of Bishops that could be placed on a chess board, as long as they dont attack each other. There are 2 alternatives proposed:
- by deep search
- by a logical model (found in the .png)
-
Notifications
You must be signed in to change notification settings - Fork 0
Gerardo-Pastor/7-Alfiles
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published