Anonymous user
Sudoku: Difference between revisions
m
→ES6
m (→ES6) |
|||
Line 4,440:
this.S = 1;
this.H = H || this;
}
}
Line 4,455:
n.L = e;
e.R.L = n;
return e.R = n;
};
Line 4,469 ⟶ 4,468:
n.U = e;
e.D.U = n;
return e.D = n;
};
Line 4,502 ⟶ 4,500:
/**
* Verbatim copy of DK's algorithm for choosing the next column object.
* @param {!DoX} h
* @return {!DoX}
*/
Line 4,553 ⟶ 4,551:
//-----------------------------------------------------------[ Print Helpers ]--
/**
* Given the standard string format of a grid, print a formatted view of it.
* @param {!string|!Array}
*/
const printGrid = function(
const getChar = c => {
let U = Math.sqrt(gArr.length);▼
let r = Number(c);
if (isNaN(r)) { return c }
let o = 48;
if (r > 9 && r < 36) { o = 55 }
return String.fromCharCode(r + o)
};
a = 'string' == typeof a ? a.split('') : a;
let N = Math.sqrt(U);
let
p.push(... Array.from(new Array(1 + N*2).fill('-')));
p.push(c);
Line 4,568 ⟶ 4,578:
}, ['\n+']).join('') + '\n';
let
return '' + p + (G && !d ? '| ' : '') + getChar(c) + ' ';
▲ if (hD) { p = `${p}${div}| `}
▲ console.log(g);
};
Line 4,603 ⟶ 4,612:
const gridMeta = s => {
const g = s.split('');
const
const
const N = Math.sqrt(
const g2D = g.map(e => isNaN(e * 1) ?
new Array(
[e * 1]);
return [
};
Line 4,723 ⟶ 4,732:
'..3......4...8..36..8...1...4..6..73...9..........2..5..4.7..686........7..6..5..'
].forEach(reduceGrid);
// Or of you want to create all the grids of a particular n-size.
// I run out of stack space at n = 9
let n = 2;
let s = new Array(Math.pow(n, 4)).fill('.').join('');
reduceGrid(s);
</lang>
| |||