2019-07-27 07:46:57 -04: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](https://igniparoustempest.github.io/tri-peaks-solitaire-solver/):
|
|
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
