Stories
Slash Boxes
Comments

SoylentNews is people

posted by LaminatorX on Wednesday July 02 2014, @12:34PM   Printer-friendly
from the Which-Door-would-He-Suggest? dept.

Computational nanoscientist Surendra Jain has written solvers for Sudoku, Killer Sudoku, Samurai Sudoku, Calcudoku, Kakuro and many other logic problems.

All are elegantly coded and very fast: for example, the "World's Hardest Sudoku" is solved in 0.05 seconds (on a 5 year old PC) and his Knight's Tour solver is an order of magnitude faster than this one.

The page (called "Classical Geek") has all source (in Fortran 90, one of the most popular languages in high-performance computing) as well as compilation and running instructions.

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 3, Funny) by wonkey_monkey on Wednesday July 02 2014, @01:28PM

    by wonkey_monkey (279) on Wednesday July 02 2014, @01:28PM (#63035) Homepage

    Is there a fast, elegant program to tell us what a computational nanoscientist is?

    --
    systemd is Roko's Basilisk
    Starting Score:    1  point
    Moderation   +1  
       Funny=1, Total=1
    Extra 'Funny' Modifier   0  
    Karma-Bonus Modifier   +1  

    Total Score:   3  
  • (Score: 1, Funny) by Anonymous Coward on Wednesday July 02 2014, @01:33PM

    by Anonymous Coward on Wednesday July 02 2014, @01:33PM (#63037)

    Is there a fast, elegant program to tell us what a computational nanoscientist is?

    Yes, but you need to delve deep in metaprogramming.

  • (Score: 4, Funny) by EvilSS on Wednesday July 02 2014, @01:53PM

    by EvilSS (1456) Subscriber Badge on Wednesday July 02 2014, @01:53PM (#63049)

    Yes, you can actually run it online from this link [google.com]