A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
Go to file
2022-09-11 13:46:17 -04:00
.eslintrc.js initial HTML implementation of user input with validation 2022-09-10 14:13:49 -04:00
.gitignore initial HTML implementation of user input with validation 2022-09-10 14:13:49 -04:00
index.html progress rendering playing cards: stock display working 2022-09-11 13:46:17 -04:00
main.js progress rendering playing cards: stock display working 2022-09-11 13:46:17 -04:00
package-lock.json initial HTML implementation of user input with validation 2022-09-10 14:13:49 -04:00
package.json initial HTML implementation of user input with validation 2022-09-10 14:13:49 -04:00
README.md implemented tests for Card.isSequential method 2022-09-11 07:19:27 -04:00
solver.js implemented tests for Card.isSequential method 2022-09-11 07:19:27 -04:00
style-cards.css progress towards rendering playing cards preview, separated parsed cardsToSolve into 2022-09-11 09:55:51 -04:00
style.scss progress rendering playing cards: stock display working 2022-09-11 13:46:17 -04:00
test.js implemented tests for Card.isSequential method 2022-09-11 07:19:27 -04:00

javascript-tri-peaks-solitaire-solver

A brute force solver for Microsoft Tri-Peaks solitaire written in javascript.

This is a fork of Courtney Pitcher's project, with several changes.

Changes

  • 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)

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 probably even less qualified...

TODO

  • HTML ui/demo in progress