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: about 2 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 (over 9 years ago)
• Default Branch: master
• Last Pushed: 2015-04-27T03:22:50.000Z (over 9 years ago)
• Last Synced: 2023-02-27T12:06:32.213Z (almost 2 years ago)
• Language: JavaScript
• Size: 336 KB
• Stars: 0
• Watchers: 2
• 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?