Update README.md

marielisepicard · web-flow · commit c7be079404b9 · 2021-12-21T14:48:14.000+01:00
diff --git a/README.md b/README.md
@@ -1,13 +1,19 @@
 # Lem In 🐜
 
 
-🇺🇸[Subject](https://cdn.intra.42.fr/pdf/pdf/6161/lem-in.en.pdf)
+🇺🇸 [Subject](https://cdn.intra.42.fr/pdf/pdf/6161/lem-in.en.pdf)
 
-🇫🇷[Subject](https://cdn.intra.42.fr/pdf/pdf/30232/fr.subject.pdf)
+🇫🇷 [Subject](https://cdn.intra.42.fr/pdf/pdf/30232/fr.subject.pdf)
 
-💦 Lem In is an algorithmic project about a [maximum flow problem](https://en.wikipedia.org/wiki/Maximum_flow_problem#:~:text=In%20optimization%20theory%2C%20maximum%20flow,such%20as%20the%20circulation%20problem.) in graph theory. 
+💦 Lem In is an **algorithmic project** about a [maximum flow problem](https://en.wikipedia.org/wiki/Maximum_flow_problem#:~:text=In%20optimization%20theory%2C%20maximum%20flow,such%20as%20the%20circulation%20problem.) in graph theory. 
 
-The goal is to find the **optimal flow of ants through an anthill** while minimizing the number of rounds to cross the anthill.
+The goal is to find the **optimal flow of ants through an anthill** while minimizing the number of rounds to cross it.
+
+ **Check that video** (from another student) to visualize what it is all about 💁🏼‍♀️
+
+<a href="http://www.youtube.com/watch?feature=player_embedded&v=d5b5Xp5Ikuw
+" target="_blank"><img src="http://img.youtube.com/vi/d5b5Xp5Ikuw/0.jpg" 
+alt="IMAGE ALT TEXT HERE" width="240" height="180" border="10" /></a>
 
 ## Ant farm description:
 
@@ -29,14 +35,14 @@ in the following format:
 - **number** of ants
 - Ant farm **description**
 
-There is **always a "start" room and an "end" room**. These rooms are preceded by a #start or #end comment. 
+There is **always a "start" room and an "end" room**. These rooms are preceded by a `#start` or `#end` comment. 
 
 At the beginning, all ants are inside the **"start room"**. 
 **The goal is to bring them to the "end room"**. 
 
 ## Solution: improved Breadth-First Search (BFS)
 
-The solution can be one or multiple paths. 
+The solution can be one or multiple paths. If you have only one ant, you'll need only one path but if there is more than one ant, you might consider finding more paths 🔎
 
 To find the best (and good number of) paths, I used an algorithm inspired by **[Breadth-first search](https://en.wikipedia.org/wiki/Breadth-first_search)**
 
@@ -53,9 +59,14 @@ However, this solution is flawed because it may prevent the program to find mult
 
 For example, this solution is not optimal because a BFS find **only one path** when the most efficient solution would be to find two paths. 
 
-### ✅ Bradth-first search + backtracking
+### ✅ Modified Bradth-first search 
+
+When looking for more than one path, we decided to **modify the BFS algorith** and **allow using a occupied room to find more path**.
+**The rule is:**
+- As long as we can find a new path without an occupied room, let's avoid occupied room. 
+- But when we have no choice, let's make a try. 
+- When we find a new solution (new path configuration), let's compare both solutions to find the most optimal one.
 
-We decided to modify the BFS algorithm and **allow backtracking on a room already included in a path**. As a result, we can find the maximum number of available path we need to solve the issue.
 
 <img src="https://raw.githubusercontent.com/marielisepicard/42lem_in/main/assets/improved_BFS.gif?token=AWE4BMTUG7ERRBVINVERHU3BYCJEG" width=50% height=50%>
 
@@ -82,3 +93,7 @@ clone the project
 `./lem-in < map`
 
 You can also create your own map 💁🏼‍♀️
+
+## Credits
+
+This project was made by @tlamart and @mpicard
