遺傳演算法（預設版） | JavaScript 程式專案

{"id":159289,"student_id":2002,"content":"// 可以修改預設密碼來測試\n// setPassword('password');\n\nvar chars = ' abcdefghijklmnopqrstuwvxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'; //密碼可能的字元\nvar pops = []; //存放要猜的密碼\n\n\nfor (var k = 0; k \u003c 20; k++) {\n    var gens = \"\";\n    for (var i = 0; i \u003c 13; i++) {\n        var rand = Math.floor(Math.random() * chars.length);\n        gens += chars[rand];\n    }\n    pops.push(gens);\n}\n\n// 按下空白按鍵來破解金庫\non('keydown', 'space', nextGeneration);\n\nfunction nextGeneration () {\n    // 學生遊戲試玩，開始實作時註解或移除\n    // var s = prompt('請輸入 21 個由英文字母大小寫、數字、空白所組成的密碼');\n    // var r = password(s);\n    // alert(`你輸入的密碼中只有 ${r} 個字是正確的！`);\n    // pops.forEach(function(p){\n    //   var r = password(p);\n    //   console.log(r);\n    // });\n    var arr = [];\n    pops.forEach(function(p) {\n        arr.push({\n            gens: p, score: password(p)});\n    });\n    arr.sort(function (a, b) {\n        return b.score - a.score;\n    });\n    var parentA = arr[0].gens;\n    var parentB = arr[1].gens;\n    for (var i = 0; i \u003c 20; i++) {\n        pops[i] = crossover(parentA, parentB);\n    }\n}\n\n// 將兩組密碼進行組合\nfunction crossover (a, b) {\n    var gens = \"\";\n    for (var i = 0; i \u003c 13; i++) {\n        if (Math.random() \u003c 0.1) {\n            var rand = Math.floor(Math.random() * chars.length);\n            gens += chars[rand];\n        } else {\n            if (Math.random() \u003e 0.5) {\n               gens += a[i]; \n            } else {\n                gens += b[i];\n            }\n        }\n    }\n    return gens;\n}","created_at":"2020-06-14T13:49:07.071+08:00","updated_at":"2020-06-14T15:25:21.380+08:00","name":"遺傳演算法（預設版）","language":"javascript","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/159289/3aa2447d9fac8895d2ab80f2348de795.jpg"},"parent_id":2,"plugin":"(function () {\n    \n    setBackdrop('hacker1.jpg', 0, 0, 640, 480);\n\n    var logs = [];\n    var key = '';\n    var gameOver = false;\n\n    function password (str) {\n\n        var count = 0;\n        for (var i = 0; i \u003c key.length; i++) {\n            if (key[i] === str[i]) count++;\n        }\n        \n        if (!gameOver) {\n            logs.unshift([str, count]);\n        }\n        \n        if (!gameOver \u0026\u0026 str.length == key.length \u0026\u0026 count === key.length) {\n            gameOver = true;\n            setBackdrop('hacker2.jpg', 0, 0, 640, 480);\n            createSound('beep.wav');\n            setTimeout(function () {\n                setBackdrop('hacker3.jpg', 0, 0, 640, 480);\n                createSound('unlock.wav');\n            }, 1000);\n        }\n        \n        return count;\n    }\n    \n    function setPassword (str) {\n        key = str;\n    }\n    \n    forever(function(){\n        for (var i=0; i\u003c14 \u0026\u0026 i\u003clogs.length; i++) {\n            print(logs.length - i, 50, 35 + 20*i, '#aaa', 14);\n            print(logs[i][1], 100, 35 + 20*i, logs[i] == key ? 'gold' : 'gold', 16);\n            print(logs[i][0], 130, 35 + 20*i, logs[i] == key ? 'gold' : 'white', 16);\n        }\n    });\n    \n    window.password = password;\n    window.setPassword = setPassword;\n\n})();\n\nsetPassword('I love Koding');\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":106,"hashid":"d5msr999","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}