https://github.com/kanaka/30queens
Minimal 30 Queens
https://github.com/kanaka/30queens
Last synced: 3 months ago
JSON representation
Minimal 30 Queens
- Host: GitHub
- URL: https://github.com/kanaka/30queens
- Owner: kanaka
- License: gpl-3.0
- Created: 2010-10-17T21:24:43.000Z (over 14 years ago)
- Default Branch: master
- Last Pushed: 2010-11-24T15:42:56.000Z (over 14 years ago)
- Last Synced: 2025-01-26T01:42:20.064Z (5 months ago)
- Language: C
- Homepage:
- Size: 109 KB
- Stars: 3
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.GPL-3
Awesome Lists containing this project
README
## Minimal 30 Queens
30 Queens is a version of the [N-Queens puzzle](http://en.wikipedia.org/wiki/Eight_queens_puzzle)
on a 30x30 chess board with 30 queens. The object is to calculate
positions for all 30 queens such that no queen is attacking any other
queen.
### History
[Aaron Brooks](http://github.com/abrooks) and I were graduates from
[Taylor University](http://www.taylor.edu) and in 2003 a former CS
professor at Taylor issued a challenge to his class and alumni to
create a fast 30 queens solver.
We worked on the problem individually in our free time, but eventually
decided to
[collaborate](http://en.wikipedia.org/wiki/Pair_programming) on
a version that was still fast but as small as possible.
This is a result of that collaboration.
### Try it out
make
./h
### How does it work?
Hah! That would be too easy. Use this as a learning opportunity and
figure it out yourself (without looking in `spoilers_and_historical`
or the commit history of `h.c`).
I can promise that if you figure it out without cheating you will
learn a whole lot about not just the C language (and how it can be
terribly abused), but also many other aspects of how modern computers
work (a list of what you will learn would be 90% of the answer).