mos
/
bano
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

wording

This commit is contained in:
mos 2025-01-03 17:39:49 +01:00
parent d40037c48c
commit 2e1f524476
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -16,10 +16,10 @@ is twofold and can be described as follows:
is scored by calculating the individual box distances and the highest scoring is scored by calculating the individual box distances and the highest scoring
agents end up as a parent to newly bred agents. agents end up as a parent to newly bred agents.
The approach described above is not computationally efficient compared to others and The approach described above is computationally suboptimal compared to others and has
has a tendency to "halt" with more complex problem spaces, therefore it is more suitable a tendency to "halt" with more complex problem spaces, therefore it is more suitable
for smaller levels. To avoid early convergence one can tune the parameters according to the for smaller levels. To avoid early convergence one can tune the parameters according
complexity of the layout. to the complexity of the layout.
## Usage ## Usage