|
|
| (7 intermediate revisions by 4 users not shown) |
| Line 1: |
Line 1: |
| − | a place to talk and discuss various ideas of the implimentation of DB.
| |
| − | ----
| |
| | | | |
| − | ===Evo===
| |
| − | '''Here is how the 'evo' part works in my program:
| |
| − |
| |
| − | *A.) It uses femily based periodically changing mutation rates to avoid mullers rachet.
| |
| − |
| |
| − | *B.) Saving '''best robot''' at the end of a simulation or after n time, will result in saving a '''nuke problem''' robot or '''geek loophole''' robot, therefor the following must be done.
| |
| − |
| |
| − | #) Each robot must have its skill factor calculated to know its '''true''' best value. This is done using <b>".good"</b> in each robots substructure.
| |
| − | #) Troughout the simulation the higest peaking point of a robots skill is determind. Lets call it J
| |
| − | #) J is checked agenst the J of the three previos 'runs' (each run lests 8000 cycles (although I have "/end" display something else, I am talking about my current work right now) this is done by using an external "saecheck.txt" file.
| |
| − | ::a) If J is higher then the lest three 'runs', then 'save robots dna' is called. Wait for this 'run' to complete just incase J goes even higher.
| |
| − |
| |
| − | *C.) The true 'best robot' is now set as the robot to restart/resume the simulation with.
| |
| − |
| |
| − | i like these ideas, Bau ...<br>
| |
| − | makes a lot of sense to me. i will play with this prog this week and see how<br>
| |
| − | things go ... what questions are raised, etc ... and perhapse then know enought<br>
| |
| − | about these new features to ask relevent questions. thanks. {{User:Griz/sig}} 12:16, 2 Nov 2005 (MST)
| |
