遺傳演算法 | JavaScript 程式專案

{"id":48524,"student_id":1440,"content":"var literal = ' abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890!@#$%^\u0026*,./`[]=-+'\nvar result = []\nvar pops = []\nvar guess = []\nvar number = Math.floor(Math.random()*30)\n\nwhile (number \u003c 10) {\n    number = Math.floor(Math.random()*30)\n}\n\nfor (var i = 0; i \u003c number; i++) {\n    guess.push(literal.charAt(Math.floor(Math.random()*literal.length)))\n}\nguess = guess.join(\"\")\nsetPassword(guess)\n\nfor (var i = 0; i \u003c 20; i++) {\n    guess = []\n    for (var j = 0; j \u003c number; j++) {\n        guess.push(literal.charAt(Math.floor(Math.random()*literal.length)))\n    }\n    guess = guess.join(\"\")\n    pops.push(guess)\n}\nfor (var i = 0; i \u003c pops.length; i++) {\n    result.push({\n        \"password\": pops[i],\n        \"number\": password(pops[i])\n    })\n}\nresult.sort(function(a, b) {\n    return b.number-a.number\n})\nresult.splice(2, result.length)\n\nforever(function() {\n    pops = crossover(result[0].password, result[1].password)\n    for (var i = 0; i \u003c pops.length; i++) {\n        result.push({\n            \"password\": pops[i],\n            \"number\": password(pops[i])\n        })\n    }\n    result.sort(function(a, b) {\n        return b.number-a.number\n    })\n    result.splice(2, result.length)\n})\n\nfunction crossover (a, b) {\n    pops = []\n    for (var i = 0; i \u003c 20; i++) {\n        guess = []\n        for (var j = 0; j \u003c number; j++) {\n            if (Math.random() \u003c 0.05) {\n                guess.push(literal.charAt(Math.floor(Math.random()*literal.length)))\n            } else {\n                if (Math.random() \u003e 0.5) {\n                    guess.push(a.charAt(j))\n                } else {\n                    guess.push(b.charAt(j))\n                }\n            }\n        }\n        guess = guess.join(\"\")\n        pops.push(guess)\n    }\n    return pops\n}","created_at":"2018-11-10T18:38:30.725+08:00","updated_at":"2019-11-05T18:49:06.560+08:00","name":"遺傳演算法","language":"javascript","screenshot":{"url":"https://cdn3.koding.school/uploads/project/screenshot/48524/4753593d09a3165e4e7a445701355f16.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":178,"hashid":"wdksppv6","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}