{"_id":"a-star-search","_rev":"26-66a6d956a16d3369ba35ba25d8ed7f88","name":"a-star-search","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","dist-tags":{"latest":"0.1.13"},"versions":{"0.1.0":{"name":"a-star-search","version":"0.1.0","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and can currently supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.0","dist":{"shasum":"990e3d84ebe73b6c60ccfef94b678683bf082d02","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.0.tgz","integrity":"sha512-5MVlXRxu8KDHFXnFyB+g6T76M7n9KgEYiFTY71tD8AUEqCdBaKSXj2Mt2u50dV+fuqUy1iv5v7HqIYjRwrbqug==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCWBx+zybUIDDkRJdPsym+HQB5XK2uRcTZ9Umao+CUBGAIhALn2pxt/qoLVmJyntIlnbR6uvrN5XCcRtvpKxfEBFOFK"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.1":{"name":"a-star-search","version":"0.1.1","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and can currently supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.1","dist":{"shasum":"524dc6c816fc1934076e2ebbcb78e10de013cdf9","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.1.tgz","integrity":"sha512-xyhXDdcTiLtggr3uHdNkZ4hRfTcmZx08VWtO4gqhXeMhowgxgkux7r+Ac2uv7YUn5giR8g5oRHpwtNm3Pb7vtQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDK7pxD3GqLI/EiltGD8JlU+zbjspg/vV1OtHPe0sNqCAIgWCzVzTJnCa2xR0CJFrSJV5Y4/ZD64MY8C4lh+fjF90Y="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.2":{"name":"a-star-search","version":"0.1.2","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and can currently supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.2","dist":{"shasum":"952bb249c58a312ec1243b9ca3e8b78bd8f73f3c","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.2.tgz","integrity":"sha512-RyHcGMVjirjD+tONQfcGUHD4ZrRMKs5Ut2FWlR6KBStEUo8SEzgmK7lVoLtf+KvO9caM55800Ps0Ppy7whFfHg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDGQhBqeDWlzIkaBIqAb3P+uzahLpksUfkVLuV6YPyYnwIgPXdN6THAZcoP8RVt6ow7cBsr9beU3lnqzL10HnXr/QQ="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.3":{"name":"a-star-search","version":"0.1.3","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and can currently supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.3","dist":{"shasum":"a0286916393d3651d95d47049f9e91822056b00b","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.3.tgz","integrity":"sha512-6fIi90UtZxreg5nVfQ2v0od1N9jRguHZ+4yTA0lfGahpM0japk3LarUvyNL1hE+5kDrCfNXKJuh+7oxFtsck0Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEtJeICCrfD65AK/eZTKX9dQwqx6KkRl1krBN9Fe2i6NAiEAqPjb0RAEnknmO8mGNwfY3LCtP29fapLb8J8xJh67GYg="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.4":{"name":"a-star-search","version":"0.1.4","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and can currently supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.4","dist":{"shasum":"77c42fdbbb9a966466a07d12749551ef3fbb8cc4","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.4.tgz","integrity":"sha512-zDdjP4rFR+p9Wwr/QDNR/J7UbluociIuiGwnCbRd2uIvTtyDChpzLSlqhbVUH4Y+q+Beh17FSN44P1Ilh7ZhHw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICROil+F0+mmNhLMtT39IJIBzhAXuE1xdYKDyJR3vtjgAiEAkR4TqQlpqgXRbRnHu24GAqB6biNuaSSQv7sJktjviQ4="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.6":{"name":"a-star-search","version":"0.1.6","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and currently only supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.6","dist":{"shasum":"7a81e6845fcfcb56e2b296597fd711def6d1c727","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.6.tgz","integrity":"sha512-MPjKpm+qiQbdXI3UXdSq+ZWYKp7xy8oUKiu2xML7mkCiTQug4+gIIbNbLz8pnI4tNWjettht6u2zTXD7Lw54Yg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC1xkcsG4+y2+vlm1gRol0CzpyoFVNuu8ZCx8tHLSLALAIhAOBfMLmMYUqXD8YApGNX5hI6hq8g+XQELvf1hLK0fOYy"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.8":{"name":"a-star-search","version":"0.1.8","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed.  Works with 2D grids and currently only supports walls as obstacles within the environment. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.8","dist":{"shasum":"9b80e71ddbd26449f594efc235307f9e911930f9","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.8.tgz","integrity":"sha512-lF9F1+Zyx/Ee7DTVBNgGG+R7qKN3g/pXghjruaWZRg4mWQitK+QVJ6IbR7JPIzOsh7VSI+rOMjFkiYc5RyxPRA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCArAsbyoL88HksQtwPQ9v26ccy4ceJh3flI+JKfdu/iAIhAJPD6SAldH2g1AfNsMAXjLaofxZqP6Lxm/6zNTFoG/cI"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.9":{"name":"a-star-search","version":"0.1.9","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.9","dist":{"shasum":"165563f063d833eaef2832a7c53ec5c80a0978e6","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.9.tgz","integrity":"sha512-tV/gCFfsIL5G4PbbqHTlBsMkW0SideWkvfDV6IrYrDJorV+gOfF5EWRoKJzyjZWFMa59iEw0Uo7+yYxwqwVcQg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIH3Wk61eclrh6U5wzoyIz57+eVd8imptW6OXTFD7DQ90AiEAksvK4wYqH3lRem+gOevFLVn3dTD4eKSeM2Z7pmy2VXc="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.10":{"name":"a-star-search","version":"0.1.10","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"jade":"*","coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.10","dist":{"shasum":"a8ee663502d82b0ade0a6b790cf3d19379dad2d1","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.10.tgz","integrity":"sha512-CIhwCtY1Ww1Q1+mZ6aBTB7xrPSCAeowxDYGcT6hOdts2EmKvoVMnDAh+fVAMgzbT+K0OoyCFO1kG4hjgnvALDA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD59qCoJRIQ/O+R4H30O/kugUYvSlbEAvO0KPVg8lGTLgIgWgosIZIUzURLGMGRzhbE8VIxEMBYSa4UW/b5/JMtId4="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.11":{"name":"a-star-search","version":"0.1.11","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["a*","astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.11","dist":{"shasum":"7570c0d3865c6f23d8f66325db1606b2f329b6a0","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.11.tgz","integrity":"sha512-0ED6cqAz1Lx9KDyp5XtTMvgo9GubZWKcydRYMHeWBhQp9+uL3IsFeUqPSw9xUsZpfUo8NX556l0XgQtUw0e0ag==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIH67MtlBuP7PCWrV80uF/dIxR7rgimyvjGR5qVzDPGzrAiEAvXJAMOdx7yxzw8PxAIdvkFzd2/TTQldity9PmfLrkyo="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.12":{"name":"a-star-search","version":"0.1.12","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["a*","astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"https://github.com/hackjoy/aStar"},"dependencies":{"coffee-script":"~1.6.3","underscore":""},"devDependencies":{"jasmine-node":"","grunt":"^0.4.4","grunt-contrib-coffee":"^0.10.1"},"license":"MIT","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar","_id":"a-star-search@0.1.12","dist":{"shasum":"9dc31b20dd296c4df9c800b6b4493716edc87998","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.12.tgz","integrity":"sha512-21HP2slg0cw8R/DU553HVKbb/4auVshUFLtrd/PwZ1DfVzDFficovMCPtM3AWpnAQUzvVHd1KGkl88ipa0oT9Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDXg41ESNW5ptsSFnbSfCF5xXc9Z+ti8C1V9JUTZuZVzwIgX3KCpfQOj2FP3tj8QnY7n62xJERSx0wIVWm1MlZFnG8="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}]},"0.1.13":{"name":"a-star-search","version":"0.1.13","private":false,"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"keywords":["a*","astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"git+https://github.com/hackjoy/aStar.git"},"dependencies":{"underscore":""},"devDependencies":{"jasmine-node":""},"license":"MIT","gitHead":"08c87f44d89ab492098a24275858a9253b110e23","description":"A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.","bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"homepage":"https://github.com/hackjoy/aStar#readme","_id":"a-star-search@0.1.13","_npmVersion":"5.4.2","_nodeVersion":"8.5.0","_npmUser":{"name":"hackjoy","email":"jackhoy05@gmail.com"},"dist":{"integrity":"sha512-8dA8oNLmaMuyRZyXsDDjL5CyIFqG1IdTDH6D8/277Zkyqg/bRAII8Hw2gdikUfXRnFAerzyBPGnNtJO3xukmEw==","shasum":"28a312acde2e0682368b280b5ec377c251b308b3","tarball":"https://registry.npmjs.org/a-star-search/-/a-star-search-0.1.13.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHT659HCcY1/U9SfkeQT624eVWmrMDh3RThszM3qQCZjAiAWsRt87nrXp6hodDRRB7I4LaDNdNr+t7dgLEzR6S73jw=="}]},"maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/a-star-search-0.1.13.tgz_1506110933277_0.3990156811196357"}}},"readme":"## A* Search\n\nA special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.\n\n\n### Usage\n\nAdd `a-star-search` to your package.json and run `$ npm install`\n\nRequire aStar in your app and define the parameters of your 2D grid:\n\n```\naStar = require 'a-star-search'\nstartLocation = {xAxis: 1, yAxis: 1}\ndestination = {xAxis: 4, yAxis: 1}\nenvironment = {blockedLocations: [{xAxis: 2, yAxis: 1}, {xAxis: 2, yAxis: 2}, {xAxis: 2, yAxis: 3}], worldSize: {xAxis: 10, yAxis: 10}}\n```\n\nCall the run method passing in the parameters defined above:\n\n`aStar.run(startLocation, destination, environment)`\n\nThis returns the following shortest path:\n```\n[\n {xAxis: 1, yAxis: 1, gCost: 0, hCost: 30, fCost: 30, parent: {xAxis: 1, yAxis: 1}},\n {xAxis: 2, yAxis: 0, gCost: 14, hCost: 30, fCost: 44, parent: {xAxis: 1, yAxis: 1}},\n {xAxis: 3, yAxis: 1, gCost: 28, hCost: 10, fCost: 38, parent: {xAxis: 2, yAxis: 0}},\n {xAxis: 4, yAxis: 1, gCost: 38, hCost: 0, fCost: 38, parent: {xAxis: 3, yAxis: 1}}\n]\n```\n\nVisual representation:\n```\ny\n10 . . . . . . . . . . .\n 9 . . . . . . . . . . .\n 8 . . . . . . . . . . .\n 7 . . . . . . . . . . .\n 6 . . . . . . . . . . .\n 5 . . . . . . . . . . .\n 4 . . . . . . . . . . .\n 3 . . b . . . . . . . .\n 2 . . b . . . . . . . .\n 1 . x b x X . . . . . .\n 0 . . x . . . . . . . .\n   0 1 2 3 4 5 6 7 8 9 10 x\n```\n\n### Running the test suite\n\n```\n$ npm install\n$ NODE_ENV=development jasmine-node spec/aStarSpec.js\n```\n\n##### References\nhttp://www.policyalmanac.org/games/aStarTutorial.htm\n\nhttp://en.wikipedia.org/wiki/A*\n\nhttp://en.wikipedia.org/wiki/List_of_algorithms\n","maintainers":[{"name":"hackjoy","email":"jackhoy05@gmail.com"}],"time":{"modified":"2022-06-13T02:17:10.352Z","created":"2014-05-24T16:33:03.664Z","0.1.0":"2014-05-24T16:33:03.664Z","0.1.1":"2014-05-24T16:40:25.915Z","0.1.2":"2014-05-24T16:43:44.704Z","0.1.3":"2014-05-24T17:01:02.415Z","0.1.4":"2014-05-24T17:07:23.486Z","0.1.6":"2014-05-24T17:18:54.516Z","0.1.8":"2014-05-24T17:37:37.813Z","0.1.9":"2014-05-24T21:55:24.234Z","0.1.10":"2014-05-26T10:37:11.726Z","0.1.11":"2014-05-26T10:44:46.669Z","0.1.12":"2015-01-11T13:54:58.168Z","0.1.13":"2017-09-22T20:08:54.205Z"},"homepage":"https://github.com/hackjoy/aStar#readme","keywords":["a*","astar","star","search","game","shortest","path","pathfinding","graph","movement","map"],"repository":{"type":"git","url":"git+https://github.com/hackjoy/aStar.git"},"author":{"name":"Jack Hoy","email":"jackhoy05@gmail.com"},"bugs":{"url":"https://github.com/hackjoy/aStar/issues"},"license":"MIT","readmeFilename":"README.md"}