|
I've been a member here for who knows how long, but, I am about to take the plunge, and publish my first article ever. Please be kind. It was a lot of fun putting it together. 
|
|
|
|
|
Member since Mon 23 Jan 2012
(5 years, 7 months)
|
|
|
|
|
Well done! It's always good to get new authors in moderation.
If you are using the online editor, you may find this useful: Using the Article Editor (without losing your hair in handfuls)[^]
Please do remember that all articles need to go to moderation, and that can be a little slow at the weekend because the number of moderators around is lower; and that moderation is there to help you, as well as protect the site. To be a moderator you have to write articles, so we all know the pain of writing it, and the worse pain of some idiot misreading it and downvoting it straight away... 
So we try to help you produce an article that will not attract the morons! 
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
We are curiously awaiting your article, as already mentioned by Griff, don't be disappointed if some 'drive by downvoters' downvote your article, that happens sometimes.
Good luck 
|
|
|
|
|
Quote: It was a lot of fun putting it together.
We're going to have more fun breaking it apart!
(kidding, just kidding)
|
|
|
|
|
I you think you can 
|
|
|
|
|
|
That does not look very inviting to me, is that cat on it still alive 
|
|
|
|
|
Sweet, would love to see one of these in the park I'm at.
Someone's therapist knows all about you!
|
|
|
|
|
For those who are interested, you can download a Windows 10 Creator's Update media tool, that you can use to create a Windows 10 CU installation ISO, or a DVD, or a flash drive. The tool is available here:
Download Windows 10[^]
Apparently you will need a valid Win 10 license on the machine where you run the tool.
Get me coffee and no one gets hurt!
|
|
|
|
|
Is that general availability, or only for those in the fast ring?
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
Richard Andrew x64 wrote: Is that general availability, or only for those in the fast ring?
Aka the windows 10 ring of fire
signature upgrading ... please wait.
|
|
|
|
|
I am in the Windows Ring of Fire? Nice! I like that!
Get me coffee and no one gets hurt!
|
|
|
|
|
I believe anyone can get it, but you need a machine with a licensed copy of Windows 10 to run it. Try to download and run it to verify. 
Get me coffee and no one gets hurt!
|
|
|
|
|
|
|
This can't be real, there is a well known linear-time algorithm. It's even on wikipedia!
E: in the actual paper it is clear that what they did here is prove that a specific variant (where some queens are pre-placed) is NP-complete, so you get the prize by solving the P?=NP question.
modified 1-Sep-17 17:48pm.
|
|
|
|
|
Well,
It would take thousands of years to solve the problem on really huge grids... say 2500x2500 The whole point of the challenge is to come up with a new faster method for solving the problem.
It also takes a lot of RAM... my depth-first implementation runs out of memory on really huge grids somewhere above 900x900. I didn't spend any time optimizing so I could probably fix this with file-backed memory.
Best Wishes,
-David Delaune
|
|
|
|
|
It's already linear time, what more do you want?
Wikipedia wrote: If the goal is to find a single solution then explicit solutions exist for all n ≥ 4, requiring no combinatorial search whatsoever.
.. some formulas to calculate the placement follow, all of them trivial arithmetic.
|
|
|
|
|
Mine doesn't chew up memory as it works; it allocates all it needs at the beginning and then just uses it. As n increases, it doesn't complete in a usable amount of time of course. I don't know whether or not I let it run to completion on a large n.
Re: nQueens algorithm - Algorithms Discussion Boards[^]
|
|
|
|
|
Interesting. They mention that the problem has been expanded to a chessboard that's 1000 by 1000.
But they don't mention if there has been a corresponding increase in the number of queens. It would seem that on such a large chessboard, it would be easy to place eight queens so that no two can attack each other.
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
Apply WarCraft rules and open a portal for the team
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
Richard Andrew x64 wrote: But they don't mention if there has been a corresponding increase in the number of queens
The article itself is incomplete. The synopsis of the actual paper has the real description.
"The n-Queens problem is to place n chess queens on an n by n chessboard"
Richard Andrew x64 wrote: it would be easy to place eight queens so that no two can attack each other.
I wonder if it is a solvable problem to figure out how many possible positions eight queens could be done on a 1000x1000 board. Without using years on a computer.
|
|
|
|
|
jschell wrote: I wonder if it is a solvable problem to figure out how many possible positions eight queens could be done on a 1000x1000 board
42 
|
|
|
|
|
jschell wrote: "The n-Queens problem is to place n chess queens on an n by n chessboard"
Thank you for that clarification!
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
