adam/tripeaks-solitaire-solver-js-73k
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity

add demo url to readme

Browse source
This commit is contained in:
Adam Piontek 2022-09-14 12:22:20 -04:00
parent 69151b7d9d
commit ef47dfd00d
1 changed files with 2 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
README.md
View file

@ -1,10 +1,8 @@
# Tripeaks Solitaire Solver 73k
A brute force solver for Microsoft Tripeaks solitaire written in javascript.
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).
The `dist` folder contains an HTML+JS interface for entering cards and getting solutions. You can open it directly in a browser to try it out.
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](https://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](https://github.com/IgniparousTempest/javascript-tri-peaks-solitaire-solver), and I'm grateful for the solving algorithm & inspiration.