# HG changeset patch
# User viric@llimona
# Date 1147012264 -7200
# Node ID 443554b46d2be09db93b5acd48ef85244d254b57
# Parent  7c1e68c17c0ed02bd0294ccd497ed7b3c72618b3
Added a file with proposals.



diff -r 7c1e68c17c0e -r 443554b46d2b TODO
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/TODO	Sun May 07 16:31:04 2006 +0200
@@ -0,0 +1,7 @@
+This algorithm:
+1. Add n-level dependencies control. How? I don't know
+2. Check for boxes depending on movement from never-reachable areas.
+
+Other algorithm - endpoints:
+We don't treat box moves as moves to next cell, but to moves until an endpoint.
+This way, huge maps with many free space will be solved much faster.