{"push_id":3167172235,"size":5,"distinct_size":1,"ref":"refs/heads/fail/day23-split6","head":"2918a334a3c0795cc48f202cc0324d6888584178","before":"05947679863c98ace42dd7bcd1ec024235cb3df2","commits":[{"sha":"261a08060f6c8962f79dcf9665d6604e85d2dd49","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 23: Split by octants\n\nSignificant runtime penalty (0.9 seconds to 2.8 seconds), but surely\nfinds the correct answer.\n\nUses a branch-and-bound strategy.\n\nHas been found to be better than a \"split each octahedron into six\nsmaller ones\" strategy, perhaps because of:\n\n* Boxes get smaller faster (each is 1/8 the size of the original, rather\n  than 1/6)\n* Boxes can thus get eliminated faster (by not having large enough upper\n  bounds)","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/261a08060f6c8962f79dcf9665d6604e85d2dd49"},{"sha":"681265822c5dfa036a7f2f0418117b03186d55e6","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 24","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/681265822c5dfa036a7f2f0418117b03186d55e6"},{"sha":"b3b14033f7094212352502b72b3fcdbd68070369","author":{"name":"Peter Tseng","email":"c30405a973de8e511c734cff542b2224be71f8eb@cornell.edu"},"message":"day 25","distinct":false,"url":"https://api.github.com/repos/petertseng/adventofcode-rb-2018/commits/b3b14033f7094212352502b72b3fcdbd68070369"},{"sha":"cb63e2bf74ad6bc42c26379c10bfdfc003f70a4a","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/cb63e2bf74ad6bc42c26379c10bfdfc003f70a4a"},{"sha":"2918a334a3c0795cc48f202cc0324d6888584178","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/2918a334a3c0795cc48f202cc0324d6888584178"}]}
{"actor":{"display_login":"petertseng"}}