adam/tripeaks-solitaire-solver-js-73k
1
0
Fork 0
Code Issues 1 Pull requests Packages Projects Releases Wiki Activity

lint & format tests

Browse source
This commit is contained in:
Adam Piontek 2022-09-07 09:49:19 -04:00
parent b1b23a2fa6
commit d98778d86d
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
test.js
View file

@ -7,8 +7,8 @@ const solvable_games = [
];
const partial_games = [
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2D KH 8C 6S 6H 2C 8H JC 9C 4D AD TH 2S AS QH 5H AH 3H 2H 4S 6D 3C TS JD 9H KD AC JS 9S 4H 4C 5S 5D 5C"
]
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2D KH 8C 6S 6H 2C 8H JC 9C 4D AD TH 2S AS QH 5H AH 3H 2H 4S 6D 3C TS JD 9H KD AC JS 9S 4H 4C 5S 5D 5C",
];
it("should solve known games", () => {
assert.equal(true, true);
@ -22,7 +22,7 @@ it("should solve known games", () => {
it("should solve partial games", () => {
assert.equal(true, true);
partial_games.forEach(function (i) {
const array = i.split(" ").map(x => x === "0" ? 0 : x);
const array = i.split(" ").map((x) => (x === "0" ? 0 : x));
const result = solver.solve(array.slice(0, 28), array.slice(28, 52), 0, []);
assert.equal(result[0], true);
});