チェッカー衰弱をチート攻略


http://soysource.web.fc2.com/memory/checker_memory.html
WinChromeならF12押して以下を打つ

solve_checker.min.js

!function(){var r,c,a,n,d,f;for(Shuffle(),n=card_c.length,f=[],r=a=0,d=n;d>=0?d>a:a>d;r=d>=0?++a:--a)"n"!==card_c[r]&&f.push(function(){var a,d,f,u;for(u=[],c=a=d=r+1,f=n;f>=d?f>a:a>f;c=f>=d?++a:--a)if("n"!==card_c[c]){if(card_c[r]===card_c[c]){Card(r),Card(c);break}u.push(void 0)}return u}());return f}();

solve_checker.js

(function() {
  var c1, c2, j, len, ref, results;
  Shuffle();
  len = card_c.length;
  results = [];
  for (c1 = j = 0, ref = len; 0 <= ref ? j < ref : j > ref; c1 = 0 <= ref ? ++j : --j) {
    if (card_c[c1] === "n") {
      continue;
    }
    results.push((function() {
      var k, ref1, ref2, results1;
      results1 = [];
      for (c2 = k = ref1 = c1 + 1, ref2 = len; ref1 <= ref2 ? k < ref2 : k > ref2; c2 = ref1 <= ref2 ? ++k : --k) {
        if (card_c[c2] === "n") {
          continue;
        }
        if (card_c[c1] === card_c[c2]) {
          Card(c1);
          Card(c2);
          break;
        } else {
          results1.push(void 0);
        }
      }
      return results1;
    })());
  }
  return results;
})();

solve_checker.coffee

(->
  Shuffle()
  len = card_c.length
  for c1 in [0...len]
    continue if card_c[c1] is "n"
    for c2 in [c1+1...len]
      continue if card_c[c2] is "n"
      if card_c[c1] is card_c[c2]
        Card c1
        Card c2
        break
)()