Rosetta Code

Sudoku: Difference between revisions

← Older editNewer edit →
Content deleted Content added
m →‎[[Sudoku#ALGOL 68]]: Translation of this D version
→‎[[Sudoku#ALGOL 68]]: Translation of D version into ALGOL 68
Line 194:
8 2 6 4 1 9 7 3 5</pre>
 
=={{header|DALGOL 68}}==
{{trans|D}} Note: This specimen retains the original [[#D|D]] coding style.
<lang d>import std.stdio;
{{works with|ALGOL 68|Revision 1 - no extensions to language used.}}
{{works with|ALGOL 68G|Any - tested with release [http://sourceforge.net/projects/algol68/files/algol68g/algol68g-1.18.0/algol68g-1.18.0-9h.tiny.el5.centos.fc11.i386.rpm/download 1.18.0-9h.tiny].}}
{{wont work with|ELLA ALGOL 68|Any (with appropriate job cards) - tested with release [http://sourceforge.net/projects/algol68/files/algol68toc/algol68toc-1.8.8d/algol68toc-1.8-8d.fc9.i386.rpm/download 1.8-8d] - due to extensive use of '''format'''[ted] ''transput''.}}
<lang algol68>MODE AVAIL = [9]BOOL; # can be a box, row or col #
MODE BOX = [3, 3]CHAR;
AVAIL set; BOX box;
 
FORMAT row fmt = $"|"3(" "3(g" ")"|")l$;
bool[char]genFull() {
FORMAT line = $"+"3(7"-","+")l$;
return ['1':true,
FORMAT puzzle fmt = $f(line)3(3(f(row fmt))f(line))$;
'2':true,
'3':true,
'4':true,
'5':true,
'6':true,
'7':true,
'8':true,
'9':true];
}
// these three functions assume that the number has not already been found
bool[char]availRow(int x,int y,bool[char]available=genFull()) {
// x designates row, y designates column
foreach(ele;puzzle[x]) {
if (ele != '_') available.remove(ele);
}
return available;
}
 
AVAIL gen full = (TRUE, TRUE, TRUE, TRUE, TRUE, TRUE, TRUE, TRUE, TRUE);
bool[char]availCol(int x,int y,bool[char]available=genFull()) {
// x designates row, y designates column
for(int i = 0;i<9;i++) {
if (puzzle[i][y] != '_') available.remove(puzzle[i][y]);
}
return available;
}
 
OP REPR = (AVAIL avail)STRING: (
bool[char]availBox(int x,int y,bool[char]available=genFull()) {
STRING out := "";
// x designates row, y designates column
FOR i FROM LWB avail TO UPB avail DO
// get a base index for the boxes
IF avail[i] THEN out int+:= bxREPR(ABS ="0" x/3;bx*=3;+ i) FI
OD;
int by = y/3;by*=3;
out
for(int i = 0;i<3;i++) for(int j = 0;j<3;j++) {
);
if (puzzle[bx+i][by+j] != '_') available.remove(puzzle[bx+i][by+j]);
 
}
CHAR empty = "_";
return available;
 
}
OP -:= = (REF AVAIL set, CHAR index)VOID: (
set[ABS index - ABS "0"]:=FALSE
);
 
# these two functions assume that the number has not already been found #
PROC avail slice = (REF[]CHAR slice, REF AVAIL available)REF AVAIL:(
FOR ele FROM LWB slice TO UPB slice DO
IF slice[ele] /= empty THEN available-:=slice[ele] FI
OD;
available
);
PROC avail box = (INT x, y, REF AVAIL available)REF AVAIL:(
# x designates row, y designates column #
# get a base index for the boxes #
INT bx := x - (x-1) MOD 3;
INT by := y - (y-1) MOD 3;
REF BOX box = puzzle[bx:bx+2, by:by+2];
FOR i FROM LWB box TO UPB box DO
FOR j FROM 2 LWB box TO 2 UPB box DO
IF box[i, j] /= empty THEN available-:=box[i, j] FI
OD
OD;
available
);
[9, 9]CHAR puzzle;
PROC solve = ([,]CHAR in puzzle)VOID:(
puzzle := in puzzle;
TO UPB puzzle UP 2 DO
BOOL done := TRUE;
FOR i FROM LWB puzzle TO UPB puzzle DO
FOR j FROM 2 LWB puzzle TO 2 UPB puzzle DO
CHAR ele := puzzle[i, j];
IF ele = empty THEN
# poke at the elements that are "_" #
AVAIL remaining := avail box(i, j,
avail slice(puzzle[i, ],
avail slice(puzzle[, j],
LOC AVAIL := gen full)));
STRING s = REPR remaining;
IF UPB s = 1 THEN puzzle[i, j] := s[LWB s]
ELSE done := FALSE
FI
FI
OD
OD;
IF done THEN break FI
OD;
break:
# write out completed puzzle #
printf(($gl$, "Completed puzzle:"));
printf((puzzle fmt, puzzle))
);
main:(
solve(("394__267_",
"___3__4__",
"5__69__2_",
"_45___9__",
"6_______7",
"__7___58_",
"_1__67__8",
"__9__8___",
"_264__735"))
CO # note: This codes/algorithm does not [yet] solve: #
solve(("9__2__5__",
"_4__6__3_",
"__3_____6",
"___9__2__",
"____5__8_",
"__7__4__3",
"7_____1__",
"_5__2__4_",
"__1__6__9"))
END CO
)</lang>
Output:
<pre>
Completed puzzle:
+-------+-------+-------+
| 3 9 4 | 8 5 2 | 6 7 1 |
| 2 6 8 | 3 7 1 | 4 5 9 |
| 5 7 1 | 6 9 4 | 8 2 3 |
+-------+-------+-------+
| 1 4 5 | 7 8 3 | 9 6 2 |
| 6 8 2 | 9 4 5 | 3 1 7 |
| 9 3 7 | 1 2 6 | 5 8 4 |
+-------+-------+-------+
| 4 1 3 | 5 6 7 | 2 9 8 |
| 7 5 9 | 2 3 8 | 1 4 6 |
| 8 2 6 | 4 1 9 | 7 3 5 |
+-------+-------+-------+
</pre>
 
char[][]puzzle;
void main() {
puzzle ~= "394__267_".dup;
puzzle ~= "___3__4__".dup;
puzzle ~= "5__69__2_".dup;
puzzle ~= "_45___9__".dup;
puzzle ~= "6_______7".dup;
puzzle ~= "__7___58_".dup;
puzzle ~= "_1__67__8".dup;
puzzle ~= "__9__8___".dup;
puzzle ~= "_264__735".dup;
while(1) {
bool done = true;
foreach(i,row;puzzle) foreach(j,ref ele;row) if (ele == '_') {
// poke at the elements that are _
auto remaining = availBox(i,j,availRow(i,j,availCol(i,j)));
if (remaining.keys.length == 1) ele = remaining.keys[0];
else done = false;
}
if (done) break;
}
// write out completed puzzle
writefln("Completed puzzle:");
foreach(row;puzzle) writefln("%s",row);
}</lang>
=={{header|AutoHotkey}}==
<lang AutoHotkey>#SingleInstance, Force
Retrieved from "https://rosettacode.org/wiki/Sudoku"