Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 46faabb

Browse files
authored
Update README.md
1 parent 191fe90 commit 46faabb

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -113,12 +113,12 @@ DA.solve(plot=True)
113113

114114
***RESULTS***
115115

116-
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.
116+
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.
117117
![result1](images/results.PNG)
118118
*Fig 4. Optimal Results in Console*
119119

120120
We can see that the algorithm quickly converges to the optimal point (see Fig. 5) as reported by the original article.
121-
![result2](images/results2.PNG)
121+
![result2](images/results2.png)
122122

123123

124124
For more examples refer to the python scripts in "examples" folder. [https://github.com/tsyet12/Duelist-Algorithm-Python/tree/master/examples]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /