author | viric@llimona |
Sun, 07 May 2006 16:31:04 +0200 | |
changeset 18 | 443554b46d2b |
child 21 | e73048967870 |
permissions | -rw-r--r-- |
18 | 1 |
This algorithm: |
2 |
1. Add n-level dependencies control. How? I don't know |
|
3 |
2. Check for boxes depending on movement from never-reachable areas. |
|
4 |
||
5 |
Other algorithm - endpoints: |
|
6 |
We don't treat box moves as moves to next cell, but to moves until an endpoint. |
|
7 |
This way, huge maps with many free space will be solved much faster. |