Stories
Slash Boxes
Comments

SoylentNews is people

SoylentNews is powered by your submissions, so send in your scoop. Only 18 submissions in the queue.

Solving Logic Puzzles in Fortran

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

gambit writes:

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.
Solving Logic Puzzles in Fortran | Log In/Create an Account | Top | 28 comments | Search Discussion
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: 2) by TGV on Thursday July 03 2014, @05:20AM

    by TGV (2838) on Thursday July 03 2014, @05:20AM (#63409)

    Well, as a comment, it's rather superfluous. It's nearly the level of i++; // increase i by 1

    Starting Score:    1  point
    Karma-Bonus Modifier   +1  
    Total Score:   2  

  • (Score: 2) by KritonK on Thursday July 03 2014, @09:06AM

    by KritonK (465) on Thursday July 03 2014, @09:06AM (#63464)

    It's nearly the level of i++; // increase i by 1

    Nearly, indeed. It's more like
    i++; // increase by 2