{"push_id":713131360,"size":2,"distinct_size":2,"ref":"refs/heads/loops","head":"ad808e08e7af665cece9942c6b8977e73e14f766","before":"0a5280482a90ae62b4c34ab12553162d655ba23f","commits":[{"sha":"15c78d7306725f94e912a978343d6f0a162a8827","author":{"email":"923fbabb58f9d7dc16fb7f0f7950c679c502dd43@psualum.com","name":"David Menendez"},"message":"More tweaks","distinct":true,"url":"https://api.github.com/repos/davemenendez/alive/commits/15c78d7306725f94e912a978343d6f0a162a8827"},{"sha":"ad808e08e7af665cece9942c6b8977e73e14f766","author":{"email":"923fbabb58f9d7dc16fb7f0f7950c679c502dd43@psualum.com","name":"David Menendez"},"message":"Try all permutations when searching.\n\nThe previous attempt to avoid re-testing cycles would miss some candidates.\nUnless we can come up with something which tests everything and retests\nnothing, we're stuck with the simplest search: at least we can divide the\nnumber of loops by n.","distinct":true,"url":"https://api.github.com/repos/davemenendez/alive/commits/ad808e08e7af665cece9942c6b8977e73e14f766"}]}