hanoi/package.json

Tower of Hanoi algorithm for finding the smallest number of steps to move the stack.

{
  "name": "hanoi",
  "version": "0.0.2",
  "description": "Tower of Hanoi algorithm for finding the smallest number of steps to move the stack.",
  "main": "hanoi.js",
  "directories": {
    "test": "test"
  },
  "files": [
    "hanoi.js"
  ],
  "scripts": {
    "test": "./node_modules/tape/bin/tape test/*.js"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/miguelmota/hanoi"
  },
  "keywords": [
    "towers",
    "hanoi",
    "algorithm",
    "recursion"
  ],
  "author": {
    "name": "Miguel Mota",
    "email": "hello@miguelmota.com",
    "url": "http://www.miguelmota.com/"
  },
  "license": {
    "type": "MIT",
    "url": "https://github.com/miguelmota/hanoi/blob/master/LICENSE.md"
  },
  "bugs": {
    "url": "https://github.com/miguelmota/hanoi/issues"
  },
  "homepage": "https://github.com/miguelmota/hanoi",
  "devDependencies": {
    "tape": "^3.0.3"
  },
  "engines": {
    "node": ">=0.10.0"
  }
}