A brute force solver for tripeaks solitaire written in javascript.
https://tripeaks.73k.us
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
2 months ago | |
---|---|---|
dist | 2 months ago | |
src | 2 months ago | |
.eslintrc.json | 9 months ago | |
.gitignore | 9 months ago | |
.prettierignore | 9 months ago | |
README.md | 9 months ago | |
package-lock.json | 2 months ago | |
package.json | 2 months ago | |
solver.js | 9 months ago | |
test.js | 9 months ago | |
vite.config.js | 9 months ago |
README.md
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.