Skip to content

About

A brute force solver for tri peaks solitaire written in javascript

Resources

Stars

6 stars

Watchers

1 watching

Forks

Latest commit

 

History

5 Commits

Folders and files

Repository files navigation

javascript-tri-peaks-solitaire-solver

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

Development

npm install
npm test

Run npm run build to compile the package to dist/. The generated package supports CommonJS consumers and includes TypeScript declarations.

import {solve} from "javascript-tri-peaks-solitaire-solver";

const result = solve(pyramidCards, stockCards);

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 project started as an exercise in learning JavaScript and TypeScript.

About

A brute force solver for tri peaks solitaire written in javascript

Resources

Stars

6 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages