{"shas":[["534383a664f6d7291159eac883b424a97704e7f2","cc50c1e6b8103dca400080921d7bac3ec9f88a38@gmail.com","Experimenting with a pure-Python implementation of Bareiss's algorithm. (The numpy.linalg.det routine is hopeless for our purposes, as it turns out, because -- presumably as a result of rounding errors -- it gives completely the wrong answer quite a lot of the time, e.g. returning approximately 22 for a matrix that is obviously singular.) This is looking fairly promising as a general approach, and even the Python implementation looks likely to be fast enough for medium-sized mazes.","Robin Houston"]],"repo":"robinhouston/maze-experiments","actor":"robinhouston","ref":"refs/heads/master","size":1,"head":"534383a664f6d7291159eac883b424a97704e7f2","actor_gravatar":"b7d4b678a3b4ff1b80f5c6e70d87d04e","push_id":29820414}