adam/tripeaks-solitaire-solver-js-73k
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity
A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
38 commits 2 branches 0 tags 1.3 MiB
JavaScript 64%
HTML 31.3%
SCSS 4.7%
Find a file
Adam Piontek b0c1c4c648 reorganization
2022-09-14 07:17:24 -04:00
src reorganization 2022-09-14 07:17:24 -04:00
.eslintrc.json web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
.gitignore initial HTML implementation of user input with validation 2022-09-10 14:13:49 -04:00
.prettierignore reorganization 2022-09-14 07:17:24 -04:00
package-lock.json include html minification 2022-09-13 22:24:36 -04:00
package.json reorganization 2022-09-14 07:17:24 -04:00
README.md implemented tests for Card.isSequential method 2022-09-11 07:19:27 -04:00
run.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
solver.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
test.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
vite.config.js reorganization 2022-09-14 07:17:24 -04:00

README.md

javascript-tri-peaks-solitaire-solver

A brute force solver for Microsoft Tri-Peaks solitaire written in javascript.

This is a fork of Courtney Pitcher's project, with several changes.

Changes

  • fixed card matching, implemented card matching tests
  • solver now returns a "first best set of moves found" for unsolvable games (the first set of moves found that removes the most cards from the board)

Notes

  • Unsolvable games can take 6 or more minutes to solve, so be patient.
  • Per Courtney Pitcher, "This is probably quite a poor implementation." Please don't fault either of us, he was teaching himself javascript, and I'm probably even less qualified...

TODO

  • HTML ui/demo in progress