davidad/8queens
View on GitHub ↗ ★ 62 Assembly
x64 assembler solution to n-queens problem. Not tested for n!=8.
6 mentions on Hacker News by 4 people: 1 story, 5 comments · first 2014-02-26 · latest 2016-04-10
20082026
-
An even faster x86-64 Asm one that does it with no memory accesses - everything is in registers: https://github.com/davidad/8queens/blob/1989666c45baa639f152...
comment by userbinator · 2016-04-10 · in N-queen puzzle in 4 lines of Scala -
▲ 25
8queens – x64 assembler solution to n-queens problemstory by avinassh · 2015-03-24 · 5 comments
-
…"free 2x speedup" in asm [1]. Sure enough, solution time improved to 4.6us on my machine [2]. [1] https://github.com/davidad/8queens/commit/61119a7f0019e4a85e... [2] https://github.com/davidad/8queens/tree/free-2x-speedup
comment by davidad_ · 2014-02-26 · in Overkilling the 8-queens Problem -
…724 12 306.7616 ms 232163 14200 14 8782.4620 ms 6391931 365596 Downloading the c-versions from https://github.com/davidad/8queens/tree/%2Bc_comparison gives a reference-time using the time built-in command of around 750 ms for 10k…
comment by mzl · 2014-02-26 · in Overkilling the 8-queens Problem -
Here [1] is the comparison repository, for anyone interested. [1] https://github.com/davidad/8queens/tree/%2Bc_comparison EDIT: I don't seem to have -Ofast, but I added a note to the readme to ask people to try it. I also added the…
comment by davidad_ · 2014-02-26 · in Overkilling the 8-queens Problem -
See [1]; it is about a factor of 7 win vs. a reasonable C implementation. [1] https://github.com/davidad/8queens/tree/%2Bc_comparison
comment by davidad_ · 2014-02-26 · in Overkilling the 8-queens Problem