IT Carlow Project Showcase: Games Development Year 4
Academic Year: 2019/2020
Student Name : Przemyslaw Tomczyk
Student Number : C00218004
Project Title : Comparison of relatively new Rectangle Expansion A*(REA*) pathfinding algorithm and impact on multithreaded performance
Quick Description
Project ended up being a single threaded performance comparison between REA* and A*.
While it ended up with no multithreading, I managed to improve algorithm's path length in comparison to the author of REA*.
The algorithm is incredible, being much faster, efficient and effective at returning grid optimal paths.
I have listed some of the project features below.
Shows benefits of using a newer algorithm over the golden standard, A*
Quick switching between both algorithms.
Debug mode to step through REA* to see how it searches.
Time display for both algorithms, in micro-seconds.
Distance display to compare path length of the two algorithms.
