A brute force solver for tripeaks solitaire written in javascript. https://tripeaks.73k.us
Go to file
2022-09-07 08:37:57 -04:00
.eslintrc.js add & configure prettier for this project 2022-09-07 08:37:57 -04:00
.gitignore update .gitignore to use github default from https://raw.githubusercontent.com/github/gitignore/main/Node.gitignore 2022-09-07 08:02:41 -04:00
package-lock.json add & configure prettier for this project 2022-09-07 08:37:57 -04:00
package.json add & configure prettier for this project 2022-09-07 08:37:57 -04:00
README.md First code 2019-07-27 13:46:57 +02:00
solver.js remove unused match method parameter 2022-09-07 08:18:55 -04:00
test.js Added unit tests 2019-08-03 13:41:36 +02:00

javascript-tri-peaks-solitaire-solver

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

You can see it in action on my website:

  1. Enter the string "8S TS 4D 7S 5D 7C 2D JH AC 3S 2H 3H 9H KC QC TD 8D 9C 7H 9D JS QS 4H 5C 5S 4C 2C QD 8C KD 3D KS JD 2S 7D KH AH 5H 9S 4S QH 6S 6D 3C JC TC 8H 6C TH AS AD 6H" into the textfield.
  2. Click "import"
  3. Click "solve"

Notes

This is probably quite a poor implementation. Please don't fault me, I am teaching myself javascript.