{"push_id":3171128638,"size":4,"distinct_size":1,"ref":"refs/heads/fail/day23-split6","head":"ba56c40e90ed7eb529ff21cd727576828734ba11","before":"dd5bc5f4b8a9c26e0bdacf410edf8ffd04966cf0","commits":[{"sha":"2e266966f36e40a084f327a07f9bf8f76980e3ae","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 25","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/2e266966f36e40a084f327a07f9bf8f76980e3ae"},{"sha":"d797426e13bfd019bfae880dbf2de1609c62b526","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/d797426e13bfd019bfae880dbf2de1609c62b526"},{"sha":"d8fc527eaf6c305a58c37a054a33c6fcfe3cb297","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 25: Only check points","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/d8fc527eaf6c305a58c37a054a33c6fcfe3cb297"},{"sha":"ba56c40e90ed7eb529ff21cd727576828734ba11","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 23: Split each octahedron into six smaller ones\n\nSlower to find the initial answer: 2.8 seconds -> 3.5 seconds\n\nAlso needs to spend a huge amount of time disproving all other regions,\nwhereas octants does this very quickly.\n\nThus, turns out this is not as good as splitting into octants.","distinct":true,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/ba56c40e90ed7eb529ff21cd727576828734ba11"}]}
{"actor":{"display_login":"petertseng"}}