diff --git a/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md b/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md
index 67047c05b..ba032a068 100644
--- a/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md
+++ b/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md
@@ -4,6 +4,7 @@ A\* is a graph traversal algorithm that is used to find the shortest path betwee
 
 Visit the following resources to learn more:
 
+- [@article@Introduction to the A* Algorithm - Red Blob Games](https://www.redblobgames.com/pathfinding/a-star/introduction.html)
 - [@article@A* Search Algorithm - Wikipedia](https://en.wikipedia.org/wiki/A*_search_algorithm)
 - [@video@A* Pathfinding (E01: algorithm explanation)](https://www.youtube.com/watch?v=-L-WgKMFuhE)
-- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)
\ No newline at end of file
+- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)