{"push_id":3170761777,"size":2,"distinct_size":1,"ref":"refs/heads/fail/day23-scaling","head":"a02a5d064aa7d858ce5e2a08f952f83eab82e413","before":"876ec852c7106dfcb30a030c6dd59b5b0b6bc772","commits":[{"sha":"3ab90e4a9b96416e1dc6f5fb7cf2e8b3b90c378e","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 23: Use 4d coordinates and only the vertices of each bot\n\nhttps://www.reddit.com/r/adventofcode/comments/a9co1u/day_23_part_2_adversarial_input_for_recursive/ecmpxad/\n\nMuch faster now, improvement from 2.7 seconds to 0.46 seconds.","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/3ab90e4a9b96416e1dc6f5fb7cf2e8b3b90c378e"},{"sha":"a02a5d064aa7d858ce5e2a08f952f83eab82e413","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 23: scale down / scale up\n\nWe think this might not work due to things falling between grid points\ndue to rounding.\n\nAn example input where this gives the wrong answer:\nhttps://www.reddit.com/r/adventofcode/comments/a9co1u/day_23_part_2_adversarial_input_for_recursive/\n\nThe right way to do this might involve keep upper/lower bounds, which\nmakes this like octant splitting.\n\nNote that this is slower than the octant splitting for Advent of Code\ninputs, but may be faster for specific adversarial inputs that defeat\nthe octant splitting.\nFor example, inputs with a lot of equally-plausible-looking intersection\nareas.\n\nTakes 12.7 seconds or so on my input.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/a02a5d064aa7d858ce5e2a08f952f83eab82e413"}]}
{"actor":{"display_login":"petertseng"}}