Updates and Results
Talks and Posters
Advice
Ideas
Important Figures
Write-Ups
Outreach
How-To
Funding Opportunities
GENETIS
GENETIS
Draft saved at 00:00:00
Fields marked with
*
are required
Entry time:
Tue Feb 3 15:12:06 2026
Author
*
:
Subject
*
:
<table border="1" cellpadding="1" cellspacing="1" style="width:500px"> <tbody> <tr> <td>Name</td> <td>Update</td> <td>Plans for Tomorrow</td> </tr> <tr> <td>Aelx M</td> <td> <p>Leo, Julie, and I merged the two dev branches (Antenna_Database and asymBicone) onto master. I think I resolved all of the conflicts and successfully merged. I'm going to start testing by running each setting (original, database, and asymmetric) through generation 1 to make sure that they give the correct results as the previous test runs and that they have all of the correct files they need to run correctly. Once I'm done with this I'll implement the changes I outlined last week (on the 21st I think) and begin a real run.</p> <p>I helped Ryan with the paperclip algorithm. We found the error in the roulette algorithm and it now gives results comparable to tournament mode. There is a bug that needs to be fixed (Ryan changed a variable to be taken as an input, but it's giving different results when we input the same values as it had before and neither of us can tell why) but otherwise the script looks much better than last week with the roulette fix. </p> </td> <td>I'm going to finish getting confirmation that the master branch works for each of the settings for the loop. Then I'll be ready to implement the fixes and start a real run, beginning with the symmetric setting with the database. </td> </tr> <tr> <td>Alex P</td> <td> </td> <td> </td> </tr> <tr> <td>Eliot</td> <td> </td> <td> </td> </tr> <tr> <td>Leo</td> <td> </td> <td> </td> </tr> <tr> <td>Evelyn</td> <td> </td> <td> </td> </tr> <tr> <td>Ryan</td> <td>Issues with low roulette fitness scores have been resolved (there was just an issue with checking the sum compared to the random number) and it has comparable scores to tournament after similar amounts of runs. Then I started work on fine-tuning the mutation function. Early results seem to suggest that having a high mutation rate gets closer to the optimal score faster but lower mutation rates will get closer given longer amounts of time. Finally, Alex concluded that the max fitness score for these paperclips is 9 (or more specifically one less than the number of segments), and some runs after 1000 generations are reaching into the 8.99*** for high scores and averages. So the goal for me this week is to try to reach that point faster (hopefully within 100 gen). </td> <td>Continue fine-tuning parts of paperclips to find optimal methods. If I reach that, write a bash script to autorun tests. </td> </tr> <tr> <td>Ben</td> <td> </td> <td> </td> </tr> <tr> <td>Ethan</td> <td> </td> <td> </td> </tr> </tbody> </table> <p> </p>
Encoding
:
HTML
ELCode
plain
Suppress Email notification
Attachment 1:
Drop attachments here...
Draft saved at 00:00:00
ELOG V3.1.5-fc6679b