Top
Best
New

Posted by AlexanderZ 6 days ago

Show HN: Brain Frog – Can you be random enough for 11 lines of JavaScript?(brainfrog.lol)
48 points | 32 comments
hash0 1 day ago|
I got 50 hits in 100 tries. That being said, I did not particularly like hitting that poor frog :'( Yes, I am the kind of player who would never choose the rude option when talking to an NPC.
escanor 17 hours ago||
pure random player:

  (async function(punch, delay) {
    async function sleep(ms) {
      return new Promise((resolve, _) => {
        setTimeout(resolve, ms)
      })
    }
    
    for (let i = 0; i < 100; i++) {
      punch(['L', 'R'][(Math.random() * 2) | 0])
      await sleep(delay)
    }
  })(punch, 150)
  
"cheating" player:

  (async function(oracle, punch, delay) {
    async function sleep(ms) {
      return new Promise((resolve, _) => {
        setTimeout(resolve, ms)
      })
    }
    
    for (let i = 0; i < 100; i++) {
      punch((i + 1) < oracle.minForPrediction ? ['L', 'R'][(Math.random() * 2) | 0] : oracle.predictNextPunch() === 'L' ? 'R' : 'L')
      
      await sleep(delay)
    }
  })(oracle, punch, 150)

is it possible to do any better? i haven't fully read frog/oracle code
emrtnn 14 hours ago||
Less fancy hack here, intercept the prediction function on every punch and force the frog to take the opposite side. const realPunch = punch;

punch = function(myMove) {

  oracle.predictNextPunch = function() {
    return myMove === 'L' ? 'R' : 'L'; 
  };
  
  realPunch(myMove);
};
escanor 17 hours ago||
it is:

  (async function(oracle, punch, delay) {
    async function sleep(ms) {
      return new Promise((resolve, _) => {
        setTimeout(resolve, ms)
      })
    }
    
    for (let i = 0; i < 100; i++) {
      const state = oracle._state
      const block = oracle.predictNextPunch()
      oracle._state = state
      
      punch(block === 'L' ? 'R' : 'L')
      
      await sleep(delay)
    }
  })(oracle, punch, 150)
krussikas 3 hours ago||
I once coded a rock-paper-scissors game that you can play against a tree based matcher/learner, with symmetry between the options accounted for. Pretty similar idea-wise. To be honest, it was pretty hard to get a better than random score.
mike_hock 18 hours ago||
You should make one where you can play against the branch predictors of various processors.
rllj 18 hours ago|
I was just about to comment the same! Sadly, branch predictors are incredibly well guarded secrets, mostly.
user- 20 hours ago||
I am briefly in the top ten after completely misunderstanding the rules nicee
thih9 14 hours ago|
The ultimate unpredictability.
subarctic 11 hours ago||
Curious how a couple people got >100 hits on 100 punches
IdiotSavage 19 hours ago||
If you want to see what a random distribution looks like:

  jot -r 100 0 1 | rs -t 10
I noticed my "fake randomness" is lacking long sequences of the same key. I feel like I'm "predictable" when I press the same key 5 times in a row, yet that happens a lot in a truly random distribution.
brtkwr 19 hours ago||
Would be fairer if the frog occasionally got to throw a punch or two...
pjio 17 hours ago|
In the first round I struggled to notice if I missed. The frog punching back would be a good indicator. And I wouldn't feel so guilty for punching a pacifist frog.
sscaryterry 6 days ago||
That was fun, got up to 79 :)
AlexanderZ 6 days ago|
practice mode? the record for ranked matches is 64
sscaryterry 6 days ago||
Yes
momoraul 5 days ago|
46 and that was my ceiling. frogs smarter than me.
More comments...