A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
Find a file
2022-09-15 08:10:51 -04:00
dist divided main.js sections into submodules for dev convenience 2022-09-15 08:10:51 -04:00
src divided main.js sections into submodules for dev convenience 2022-09-15 08:10:51 -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 several layout & appearance changes 2022-09-14 09:54:03 -04:00
package.json divided main.js sections into submodules for dev convenience 2022-09-15 08:10:51 -04:00
README.md add demo url to readme 2022-09-14 12:22:20 -04:00
solver.js fix issue 2, report proper cards cleared progress 2022-09-15 07:31:26 -04:00
test.js web page fully working as desired in dev 2022-09-13 20:05:14 -04:00
vite.config.js several layout & appearance changes 2022-09-14 09:54:03 -04:00

Tripeaks Solitaire Solver 73k

A brute force solver for Microsoft Tripeaks solitaire written in javascript. The solver can provide a "best moves" list (the first set of moves found that removes the most cards from the board) for unsolvable games, and games-in-progress (when you don't already know all the cards).

A live demo is available at tripeaks.73k.us where you can input cards and get solutions. The same files published there are available in this repo's dist directory.

This began as a fork of Courtney Pitcher's project, and I'm grateful for the solving algorithm & inspiration.

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 just having fun.
  • The HTML+JS interface is built with Vite, Alpine.js, Bootstrap, and some free customized SVG playing cards. Linting & formatting is included.