A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
Adam Piontek 45000d1b33
updated vite dep, improved footer
5 months ago
dist updated vite dep, improved footer 5 months ago
src updated vite dep, improved footer 5 months ago
.eslintrc.json web page fully working as desired in dev 5 months ago
.gitignore initial HTML implementation of user input with validation 5 months ago
.prettierignore reorganization 5 months ago
README.md add demo url to readme 5 months ago
package-lock.json updated vite dep, improved footer 5 months ago
package.json updated vite dep, improved footer 5 months ago
solver.js fix issue 2, report proper cards cleared progress 5 months ago
test.js web page fully working as desired in dev 5 months ago
vite.config.js several layout & appearance changes 5 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.