https://github.com/ratracegrad/n-queens
Given an n x n chessboard, how many different ways can you place n queens, such that none of them can attack each other?
https://github.com/ratracegrad/n-queens
Last synced: 3 months ago
JSON representation
Given an n x n chessboard, how many different ways can you place n queens, such that none of them can attack each other?
- Host: GitHub
- URL: https://github.com/ratracegrad/n-queens
- Owner: ratracegrad
- Created: 2015-04-27T03:20:18.000Z (about 10 years ago)
- Default Branch: master
- Last Pushed: 2015-04-27T03:22:50.000Z (about 10 years ago)
- Last Synced: 2025-01-06T08:19:59.037Z (5 months ago)
- Language: JavaScript
- Size: 336 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# N-Queens
Given an n x n chessboard, how many different ways can you place n queens, such that none of them can attack each other?