| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add basic documentationHEADmaster | Arthur de Jong | 2016-11-13 | 4 | -3/+143 |
| * | Add tests | Arthur de Jong | 2016-11-12 | 1 | -1/+100 |
| * | Remove scoring | Arthur de Jong | 2016-11-12 | 1 | -14/+1 |
| * | Use queue to do breadth-first traversal | Arthur de Jong | 2016-11-12 | 1 | -23/+20 |
| * | Add basic files | Arthur de Jong | 2016-11-12 | 2 | -0/+22 |
| * | Try to find shorter paths to previously seen boards | Arthur de Jong | 2016-11-10 | 1 | -3/+5 |
| * | Better way to short-circuit | Arthur de Jong | 2016-11-10 | 1 | -10/+4 |
| * | Do not recurse further when we have a solution | Arthur de Jong | 2016-11-10 | 1 | -0/+5 |
| * | Try scoring as a mechanism to find shorter solutions | Arthur de Jong | 2016-11-10 | 1 | -2/+11 |
| * | Support vertical moves and remove print statements | Arthur de Jong | 2016-11-10 | 1 | -12/+17 |
| * | Change recursion to return found solutions early | Arthur de Jong | 2016-11-10 | 1 | -8/+16 |
| * | Also move cars to the left | Arthur de Jong | 2016-11-10 | 1 | -13/+10 |
| * | Correctly find moves to the right | Arthur de Jong | 2016-11-10 | 1 | -20/+34 |
| * | Work in progress | Arthur de Jong | 2016-11-10 | 1 | -0/+51 |
| * | Initial version of base algorithm | Arthur de Jong | 2016-11-10 | 2 | -0/+57 |