2019-07-27 07:46:57 -04:00
# javascript-tri-peaks-solitaire-solver
2022-09-07 08:49:25 -04:00
2019-07-27 07:46:57 -04:00
A brute force solver for Microsoft Tri-Peaks solitaire written in javascript.
2022-09-11 07:19:27 -04:00
This is a fork of [Courtney Pitcher's project ](https://github.com/IgniparousTempest/javascript-tri-peaks-solitaire-solver ), with several changes.
2019-07-27 07:46:57 -04:00
2022-09-11 07:19:27 -04:00
## Changes
2022-09-10 14:13:49 -04:00
2022-09-11 07:19:27 -04:00
- 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)
2022-09-07 20:54:49 -04:00
2022-09-11 07:19:27 -04:00
## Notes
2022-09-07 20:54:49 -04:00
2022-09-11 07:19:27 -04:00
- 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...
2019-07-27 07:46:57 -04:00
2022-09-11 07:19:27 -04:00
## TODO
2019-07-27 07:46:57 -04:00
2022-09-11 07:19:27 -04:00
- [ ] HTML ui/demo _in progress_