Genetic Algorithm | JavaScript 程式專案

{"id":26660,"student_id":2591,"content":"var key = \"to be or not to be qwq !~~\";\nvar alphabet = \" abcdefghijklmnopqrstuwvxyz!~\"\nvar population = [];\nvar children = [];\nvar mutationRate = 0.01;\nvar size = 300;\nwhile(population.length \u003c size){\n    randomDNA();\n}\n\nfunction randomDNA () {\n    var d = \"\";\n    for(var i = 0 ; i \u003c key.length; i++){\n        d += alphabet[Math.floor(Math.random() * alphabet.length)];\n    }\n    population.push(d);\n}\n\nfunction fitness (dna) {\n    var count = 0;\n    for(var i = 0 ; i \u003c key.length; i++){\n        if(dna[i] == key[i]){\n            count++;\n        }\n    }\n    return count;\n}\n\nfunction matePool (){\n    while(children.length \u003c size){\n        crossover(population[Math.floor(Math.random()*size/2)],population[Math.floor(Math.random()*size/2)]);\n    }\n    population = children;\n    children = [];\n    population.sort(function(a, b){\n        return fitness(b) - fitness(a);\n    });\n}\n\nfunction crossover (a, b) {\n    var c = \"\"\n    var mid = Math.floor(Math.random()*key.length);\n    for(var i = 0; i \u003c key.length; i++){\n        if(i \u003c mid){\n            c += a[i];\n        }else{\n            c += b[i];\n        }\n        if(Math.random() \u003c mutationRate){\n            c = c.substr(0, i) + alphabet[Math.floor(Math.random() * alphabet.length)] + c.substr(i + 1);\n        }\n    }\n    children.push(c);\n}\n\nforever(function(){\n    print(key);\n    print(population[0], 10, 30);\n    if(population[0] != key){\n        matePool();\n    }\n});\n","created_at":"2018-04-20T16:27:16.559+08:00","updated_at":"2019-10-13T18:51:02.100+08:00","name":"Genetic Algorithm","language":"javascript","screenshot":{"url":"https://cdn3.koding.school/uploads/project/screenshot/26660/89edcce60b8890776f43b51e69f48ea4.jpg"},"parent_id":2,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":111,"hashid":"npmszpq9","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}