News for hackers. Stuff that matters.
Re:Multicore-enabling the N-Queens Problem Using Cilk++ by pmorici on Friday September 05, 2008 @01:13AM (#295588)
He left out the most efficient solution. Using bits to store the positions instead of an array then you can check if the queens conflict with a couple bitwise &&'s instead of looping.
Re:Multicore-enabling the N-Queens Problem Using Cilk++ by threadman on Friday September 05, 2008 @01:26AM (#295596)
interesting point - worth a comment in the blog post
Re:Multicore-enabling the N-Queens Problem Using Cilk++ by wastedbrains on Thursday September 04, 2008 @11:28PM (#295501)
Nice N-Queens is one of my favorite problems to play around with. I often solve it when learning a new language.
Re:Multicore-enabling the N-Queens Problem Using Cilk++ by queensnake on Friday September 05, 2008 @07:21AM (#295768)
Intel's TBB adopts + translates much, from Cilk to C++.
Re:Multicore-enabling the N-Queens Problem Using Cilk++ by threadman on Friday September 05, 2008 @08:23AM (#295794)
TBB borrows the scheduling portion, but requires substantial code restructuring, and doesn't have a solution for the global variable problem analogous to Cilk's hyperobjects.