Update README.md

Author: tsyet12

README.md

@@ -113,12 +113,12 @@ DA.solve(plot=True)
 
 ***RESULTS***
 
-From the console we can deduce the optimal result (see Fig. 4) . The global optimal has a fitness of 25. So Duelist Algorithm performs well.
+From the console we can deduce the optimal result (see Fig. 4) . The global optimal has a fitness of 25, while duelist algorithm found 25.01. So Duelist Algorithm performs well.
 ![result1](images/results.PNG)
 *Fig 4. Optimal Results in Console*
 
 We can see that the algorithm quickly converges to the optimal point (see Fig. 5) as reported by the original article.
-![result2](images/results2.PNG)
+![result2](images/results2.png)
 
 
 For more examples refer to the python scripts in "examples" folder. [https://github.com/tsyet12/Duelist-Algorithm-Python/tree/master/examples]