A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
Find a file
2022-09-13 21:17:10 -04:00
cards
.eslintrc.json web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
.gitignore
cardSvgs.js
index.html improved page layout, added vite config for './' base path 2022-09-13 21:17:10 -04:00
main.js improved page layout, added vite config for './' base path 2022-09-13 21:17:10 -04:00
package-lock.json web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
package.json web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
README.md
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
solverWorker.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
style.scss
test.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
vite.config.js improved page layout, added vite config for './' base path 2022-09-13 21:17:10 -04:00

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