遺傳演算法副本 | JavaScript 程式專案

{"id":48487,"student_id":227,"content":"// 可以修改預設密碼來測試\n\n// 不斷嘗試密碼並將分數高的排在前面，產生下一代的密碼\nvar chars = ' abcdefghijklmnopqrstuvwxyzABCKEFGHIJKLMNOPQRSTUVWXYZ'\nvar pops = []\nfor (var i = 0; i \u003c 20; i++) {\n    var gens = ''\n    for (var j = 0; j \u003c 23; j++) {\n        var num = Math.floor(Math.random()*53)\n        gens += chars[num]\n    }\n    pops.push(gens)\n}\npops.sort(function (a, b) {\n    return password(b) - password(a);\n});\nconsole.log(password(pops[0]))\nconsole.log(password(pops[1]))\nforever(function() {\n    var children = []\n    pops.sort(function(a,b){\n        return password(b) - password(a)\n    })\n    for(var i = 0;i\u003c20;i++){\n        var child = crossover(pops[0],pops[1])\n        children.push(child)\n    }\n    pops = children\n})\n\n// 將兩組密碼進行組合\nfunction crossover (a, b) {\n    var gens = ''\n    for (var i = 0; i \u003c 23; i++) {\n        var num = Math.random()\n        if (num \u003c 0.05) {\n            var num1 = Math.floor(Math.random()*53)\n            gens += chars[num1]\n        } else if (num \u003c 0.5025) {\n            gens += a[i]\n        } else {\n            gens += b[i]\n        }\n    }\n    return gens\n}","created_at":"2018-11-10T16:16:59.178+08:00","updated_at":"2019-10-30T20:56:36.492+08:00","name":"遺傳演算法 副本","language":"javascript","screenshot":{"url":"https://cdn1.koding.school/uploads/project/screenshot/48487/2191212943f01e4a3fefb42325fa2203.jpg"},"parent_id":33940,"plugin":"setBackdrop('hacker1.jpg', 0, 0, 640, 480);\n\nvar game = (function () {\n    \n    var log = [];\n    var key = 'I love Koding very much';\n    var gameOver = false;\n    \n    when('click', function () {\n       if (prompt('請輸入密碼？') == key) {\n            setBackdrop('hacker2.jpg', 0, 0, 640, 480);\n            setTimeout(function() {\n                setBackdrop('hacker3.jpg', 0, 0, 640, 480);\n                stop();\n            }, 1000);\n       }\n    });\n    \n    function password (passwd) {\n        if (gameOver) return;\n        if (passwd == key) gameOver = true;\n        \n        log.unshift(passwd);\n        var count = 0;\n        for (var i = 0; i \u003c key.length; i++) {\n            if (key[i] == passwd[i]) count++;\n        }\n        return count;\n    }\n    \n    function setPassword (passwd) {\n        key = passwd;\n    }\n    \n    forever(function(){\n        for (var i=0; i\u003c14 \u0026\u0026 i\u003clog.length; i++) {\n            print(log[i], 50, 35 + 20*i, log[i] == key ? 'gold' : 'white');\n        }\n    });\n\n    return {\n        password: password,\n        setPassword: setPassword\n    }\n})();\n\nvar password = game.password;\nvar setPassword = game.setPassword;\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":71,"hashid":"4y3s9344","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}