| 1 | local key; -- table to hold the future keys pressed
|
| 2 | local lastkey; -- keys pressed in previous frame
|
| 3 | local frames = 0; -- number of frames (current value is current frame count)
|
| 4 | local attempts = 1; -- number of attempts (current value is current attempt)
|
| 5 | local okattempts = 0;
|
| 6 | local failattempts = 0;
|
| 7 |
|
| 8 | local maxframes = 100;
|
| 9 | local maxattempts = 5;
|
| 10 |
|
| 11 | local records = {};
|
| 12 |
|
| 13 | local function getOk() -- is current run ok? heuristic value 0-100! 100 = always yes, 0 = always no
|
| 14 | return 100;
|
| 15 | end
|
| 16 |
|
| 17 | local function getScore() -- score of current attempt
|
| 18 | return math.random(0,100);
|
| 19 | end
|
| 20 |
|
| 21 | local function getTie1() -- tie breaker of current attempt in case score is equal
|
| 22 | return math.random(0,100);
|
| 23 | end
|
| 24 |
|
| 25 | local function getTie2() -- second tie breaker
|
| 26 | return math.random(0,100);
|
| 27 | end
|
| 28 |
|
| 29 | local function getTie3() -- third tie breaker
|
| 30 | return math.random(0,100);
|
| 31 | end
|
| 32 |
|
| 33 | local function getTie4() -- fourth tie breaker
|
| 34 | return math.random(0,100);
|
| 35 | end
|
| 36 |
|
| 37 | local function getSegmentEnd()
|
| 38 | if (attempts >= maxattempts) then return 100 end;
|
| 39 | return 0;
|
| 40 | end
|
| 41 |
|
| 42 | local function getAttemptEnd() -- determine when a attempt should be restarted
|
| 43 | if (frames >= maxframes) then return 100 end;
|
| 44 | return 0;
|
| 45 | end
|
| 46 |
|
| 47 | local function getA()
|
| 48 | return math.random(0,100);
|
| 49 | end;
|
| 50 |
|
| 51 | local function getB()
|
| 52 | return math.random(0,100);
|
| 53 | end;
|
| 54 |
|
| 55 | local function getStart()
|
| 56 | return math.random(0,100);
|
| 57 | end;
|
| 58 |
|
| 59 | local function getSelect()
|
| 60 | return math.random(0,100);
|
| 61 | end;
|
| 62 |
|
| 63 | local function getUp()
|
| 64 | return math.random(0,100);
|
| 65 | end;
|
| 66 |
|
| 67 | local function getDown()
|
| 68 | return math.random(0,100);
|
| 69 | end;
|
| 70 |
|
| 71 | local function getLeft()
|
| 72 | return math.random(0,100);
|
| 73 | end;
|
| 74 |
|
| 75 | local function getRight()
|
| 76 | return math.random(0,100);
|
| 77 | end;
|
| 78 |
|
| 79 | -- This will loops for each frame, at the end of the while
|
| 80 | -- the frameadvance is called, causing it to advance
|
| 81 | while (getSegmentEnd() <= math.random(0,99)) do
|
| 82 | frames = frames + 1; -- inrease the frame count (++frames?)
|
| 83 | if (getAttemptEnd() > math.random(0, 99)) then -- load save state, continue with next attempt
|
| 84 | frames = 1;
|
| 85 | -- record this attempt
|
| 86 | if (not records.prev) then records.prev = {}; end;
|
| 87 | records.prev.frames = frames;
|
| 88 | records.prev.attempt = attempts;
|
| 89 | records.prev.score = getScore();
|
| 90 | records.prev.tie1 = getTie1();
|
| 91 | records.prev.tie2 = getTie2();
|
| 92 | records.prev.tie3 = getTie3();
|
| 93 | records.prev.tie4 = getTie4();
|
| 94 | records.prev.ok = (getOk() > math.random(0,99)); -- this is the check whether this attempt was valid or not. if not, it cannot become the best attempt.
|
| 95 | -- update ok/failed attempt counters
|
| 96 | if (records.prev.ok) then
|
| 97 | okattempts = okattempts + 1;
|
| 98 | else
|
| 99 | failattempts = failattempts + 1;
|
| 100 | end;
|
| 101 | -- if this attempt was better then the previous one, replace it
|
| 102 | -- its a long IF, but all it checks (lazy eval) is whether the current
|
| 103 | -- score is better then the previous one, or if its equal and the tie1
|
| 104 | -- is better then the previous tie1 or if the tie1 is equal to the prev
|
| 105 | -- etc... for all four ties. Only tie4 actually needs to be better, tie1
|
| 106 | -- through tie3 can be equal as well, as long as the next tie breaks the
|
| 107 | -- same tie of the previous attempt :)
|
| 108 | if (records.prev.ok and (not records.best or (getScore() > records.best.score or (getScore() == records.best.score and (getTie1() > records.best.tie1 or (getTie1() == records.best.tie1 and (getTie1() > records.best.tie1 or (getTie1() == records.best.tie1 and (getTie1() > records.best.tie1 or (getTie1() == records.best.tie1 and getTie1() > records.best.tie1)))))))))) then
|
| 109 | -- previous attempt was better then current best (or no current best
|
| 110 | -- exists), so we (re)place it.
|
| 111 | if (not records.best) then records.best = {}; end;
|
| 112 | records.best.frames = records.prev.frames;
|
| 113 | records.best.attempt = records.prev.attempt;
|
| 114 | records.best.score = records.prev.score;
|
| 115 | records.best.tie1 = records.prev.tie1;
|
| 116 | records.best.tie2 = records.prev.tie2;
|
| 117 | records.best.tie3 = records.prev.tie3;
|
| 118 | records.best.tie4 = records.prev.tie4;
|
| 119 | end
|
| 120 | attempts = attempts + 1;
|
| 121 | end -- continues with new attempt
|
| 122 | gui.text(10,10,"Attempt: "..attempts.."\nFrame: "..frames);
|
| 123 |
|
| 124 | key = {};
|
| 125 | if (getUp() > math.random(0, 99) ) then key.up = 1; end;
|
| 126 | if (getDown() > math.random(0, 99)) then key.down = 1; end;
|
| 127 | if (getLeft() > math.random(0, 99)) then key.left = 1; end;
|
| 128 | if (getRight() > math.random(0, 99)) then key.right = 1; end;
|
| 129 | if (getA() > math.random(0, 99)) then key.A = 1; end;
|
| 130 | if (getB() > math.random(0, 99)) then key.B = 1; end;
|
| 131 | if (getSelect() > math.random(0, 99)) then key.select = 1; end;
|
| 132 | --if (getStart() > math.random(0, 99)) then key.start = 1; end;
|
| 133 | lastkey = key;
|
| 134 | joypad.set(1, key);
|
| 135 | -- next frame
|
| 136 | FCEU.frameadvance()
|
| 137 | end;
|
| 138 |
|