Sudoku Brute Force Solver

9077b962-e880-46c9-b421-46f89e031ad4 78 4 5 false false 0 decimal

&[DATE] &[TIME] - &[FILENAME]

Π Sudoku M Π : S 0 : s 0 : ν 0 : U 0 : n 1 : no 1 : 17 mat λ 181 range M λ el 0 ≡ U ν ν 1 + : el λ : continue if for n ν ≤ S s s 1 + : el M : r U n el 1 - 9 / trunc 1 + : c U n el 1 - 9 mod 1 + : 12 mat ro 3 r 1 - 3 / trunc * 1 + : co 3 c 1 - 3 / trunc * 1 + : 12 mat N no 9 range φ 0 : k 19 range M r k el N ≡ (M k c el N ≡ (| (M ro k 1 - 3 mod + co k 1 - 3 / trunc + el N ≡ (| φ 1 : break 21 line continue if for φ 0 ≡ M U n el el N : n n 1 + : no 1 : 13 mat break 21 line φ 1 ≡ (N 9 ≡ (& no 10 : no 9 > n 1 ≡ Can't solve the puzzle. error n n 1 - : no M U n el el 1 + : M U n el el 0 : 13 mat if while break 31 line continue if if 31 line for 41 line while S s s 1 + : el M : 41 line :

Notation: Π = Puzzle (9x9 matrix) U = Unsolved (column vector) ν = lenght(Unsolve) n = counter for ν N = sudoku 1-9 number r,c = row, col of M ro,co = rowStart, colStart φ = flag "Not avaible"

M Mo PlotSudoku x 0 : y 0 : r 1 M rows range : c 1 M cols range : P 05 matrix : 15 mat r 1 M rows range c 1 M cols range P P c 10 r - M r c el num2str 8 Mo r c el 0 ≡ red blue if 15 mat stack eval : for for P eval 31 line :

Animation

Very simple problem, for testing purposes. A true problem can take very long time, because the procedure store all intermediate steps.

M 04863029110347065865081943726504871387910354631475682992736418553628197448159736099 mat :

S M Sudoku :

N S length : 9

n 1 N range :

whatever min 1 ≡ increment 1 ≡ maximum value N ≡ TickPosition both ≡ tickFrequency 1 ≡ 51 sys :

Can't animate this for n, using S[n instead S[N

S N el S k el PlotSudoku 1 1 sys

Alvaro