Scopul nostru este sprijinirea şi promovarea cercetării ştiinţifice şi facilitarea comunicării între cercetătorii români din întreaga lume.
For those who enjoy the challenge of a hard Suduko puzzle it could be seen as something of cop-out.
But for those who find them too much of a struggle it could be, literally, just the solution.
Two researchers have developed a mathematical algorithm that solves Sudoku puzzles very quickly, without any guessing or backtracking.
Complex networks researcher Zoltan Toroczkai and Notre Dame postdoctoral researcher Maria Ercsey-Ravasz, from the University of Notre Dame also say they can also explain why some puzzles are harder than others.
Toroczkai and Ercsey-Ravasz, who also studies at Romania’s Babes-Bolyai University, began analysing Sudoku as part of their research into the theory of optimisation and computational complexity.
NOTE: The title (coming from the first quoted press release) is somewhat misleading: Sudoku is a problem that CANNOT be solved efficiently in the general case (it is an NP-complete problem) The algorithm given by Toroczkai and Ercsey-Ravasz does not get around this fundamental limitation, as it comes with no guarantees of efficiency.