https://github.com/whichxjy/not-cool

Pathfinding algorithms for TIC-80
https://github.com/whichxjy/not-cool

Last synced: about 2 months ago
JSON representation

Pathfinding algorithms for TIC-80

• Host: GitHub
• URL: https://github.com/whichxjy/not-cool
• Owner: whichxjy
• Created: 2019-05-02T15:17:50.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2019-05-10T16:15:47.000Z (over 5 years ago)
• Last Synced: 2024-06-15T03:35:15.946Z (4 months ago)
• Language: Lua
• Homepage:
• Size: 38.1 KB
• Stars: 5
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

• awesome-tic-80 - not-cool

README

        
# Not Cool

Here are some pathfinding algorithms for [TIC-80](https://tic.computer/).

They're not COOOOOOOOOOOOOOOOOL.

## Demo

![Demo](https://github.com/whichxjy/not-cool/blob/master/demo.gif)

## Usage

1. Run TIC-80.

2. Choose an algorithm and place `xxx.lua` by your current working directory.

  * `a-star.lua` - A* Search

  * `bfs.lua` - Breadth First Search

  * `bi-dir-bfs.lua` - Bidirectional BFS

  * `dfs.lua` - Depth First Search

  * `dijkstra.lua` - Dijkstra's Algorithm

  * `gbfs.lua` - Greedy Best First Search

  * `ida-star.lua` - Iterative Deepening A*

  * `iddfs.lua` - Iterative Deepening DFS

3. Add `dofile('xxx.lua')` to the first line of code editor.

4. Import sprites from `sprites.gif`.

5. Import map from `world.map`, or draw it yourself.

6. Run cartridge.

## Key Map

|    Action   |    Key       |

|:-----------:|:------------:|

| Control "C" |     Z        |

| Control "L" |     X        |

| Up          | Up Arrow     |

| Down        | Down Arrow   |

| Left        | Left  Arrow  |

| Right       | Right  Arrow |