Fast Random Pathfinder

A fast pathfinder that traverses randomly and self-optimizes.

Table of Contents

1. About
2. Getting started
   • Prerequisites
   • Installation
3. Usage
4. License
5. Contact
6. Acknowledgments

About

Fast Random Pathfinder is a pathfinding algorithm that, as the name implies, traverses randomly until reaching it's goal. Although random, it is comparibly faster than alternative random pathfinding solutions. Fast Random Pathfinder also iteratively optimizes itself, increasing the odds of finding an optimal path.

It should be said that there is little use for a pathfinder that relies solely on random chance when traversing. This project exists solely for curiosity's sake, and should not even be considered for actual use cases when alternatives like A* exist.

Read an in-depth analysis of this project here.

(back to top)

Getting started

Prerequisites

Fast Random Pathfinder relies on <windows.h> for visualization, making compilation difficult on Linux/macOS systems without the use of a virtual environment.

Installation

1. Clone/download the repo

   git clone https://github.com/nTh0rn/fast-random-pathfinder.git

(back to top)

Usage

1. Modify any of the following values within fast-random-pathfinder.cpp
   1.1 mapW and mapH to change map grid size
   1.2 depth to either 1 or 2 to set the depth of the backtracking maze generation algorithm.
2. Build to .exe using CMake

   cmake build .

(back to top)

License

Distributed under the MIT License. See LICENSE.txt for more information.

(back to top)

Contact

Nikolas Thornton - nthorn.com - contact@nthorn.com

(back to top)

Acknowledgments

• C++ Clear Screen

(back to top)