Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

cpp-tutor/tower

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

6 Commits

Repository files navigation

Tower

The problem:

Move all of the discs from the left-hand peg to the right-hand peg without stacking any bigger disc on a smaller one.

The solution:

A two-case recursion algorithm written in JavaScript, with output to an HTML5 canvas element.

To use:

View the file tower.html live in your browser (either online or offline).

About

Fun JavaScript/browser implementation of the South-East Asian Disc-Stacking Problem

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

AltStyle によって変換されたページ (->オリジナル) /