12:30 am
UnikeTheHunter
I'm working in violation of Hurshey's first rule again. I'd better try again in the morning.
12:33 am
KnightTime
hurshey's rule not withstanding this is a medium at best. No way this is an expert. Solved with pairs only.
4:31 am
bzikofski
after 2 years of break, let's see what i can do
5:03 am
bzikofski
i dont know any techniques but was able to do it with one checkpoint
8:17 am
spellacked
Yeah, definitely not an expert... although i did mess it up once clicking through a bit too fast.
11:55 am
drwho
Difficulty score 45. Not too hard with green, but it was an expert.
5:01 pm
UnikeTheHunter
Did it, no green, no guess, no fuss, no muss. Pretty easy after getting some sleep.
6:44 pm
Marc
Where can I get a copy of the Java Script
10:34 pm
KnightTime
Marc - javascript:for (i=1; i<=9; i++) {for (j=1; j<=9; j++) {if (grid[i][j].value == '') {ClearTinySquares(i,j);}}}for (i=1; i<=9; i++) {for (j=1; j<=9; j++) {if (grid[i][j].value != '') {var tmp_value = grid[i][j].value;for (k=1; k<=9; k++) {for (l=1; l<=9; l++) {if (grid[k][l].value == '') {if ((Math.ceil(i/3) == Math.ceil(k/3) && Math.ceil(j/3) == Math.ceil(l/3)) || i == k || j == l) {grid[k][l]['mini'][tmp_value] = -1;}}}}}}}for (i=1; i<=9; i++) { for (j=1; j<=9; j++) { if (grid[i][j].value == '') { for (k=1; k<=9; k++) { if (grid[i][j]['mini'][k] != -1) grid[i][j]['mini'][k] = 1; }}}}for (i=1; i<=9; i++) {for (j=1; j<=9; j++) {if (grid[i][j].value == '') {for (k=1; k<=9; k++) {if (grid[i][j]['mini'][k] != 1) grid[i][j]['mini'][k] = 0;}}}}PopulatePuzzle(grid);void(0);
