-=- net.aronnax.CountPaths -=-

The CountPaths program is a way to count the number of 
simple paths between two points on a rectangular grid.
Which is to say that adjacent vertices must connect 
horizontally or vertically (no diagonals).

The program was originally devised to try and solve the 
knights-move resister problem on the Google Labs 
Aptitude Test (GLAT). For some reason, I convinced myself 
that knowing the total number of paths with a given 
number of steps could be turned into an effective 
resistance. Just after finishing the code, I realized 
I was wrong...about the same time I realized that if 
I had been right, the answer would be zero Ohms.

Anyway, enough of my sorrows...

The point is that this code can be used to count simple 
paths of a certain number of steps in an infinite 
rectangular grid (as described above). If that helps you, 
good. If not, *shrugs*.

By the way, if you run out of memory ("Java Heap" error), 
you can pump up the heap with the -Xmx command. The default 
is usually -Xmx128m or 128 MB. For 1 GB of heap, just run 
the code as: java -Xmx1024m net.aronnax.CountPaths

Additionally, if you are modifying the code for some other
use and are getting sick of the net.aronnax.CountPaths 
stuff, just remove the "package net.aronnax.CountPaths" 
line from the start of the *.java files and recompile.

--Miles.

$Id: README.txt 44 2010-12-27 22:46:24Z rassilon $
