There is a lot of array-oriented thinking in a series of four blog posts by Twan van Laarhoven. The ideas include tensor product of rings and arrays as polynomials. Although his code is in Haskell, some here may share my interest in what he's written. I won't be surprised if somebody finds something fun to translate into J, or to do differently in J.
Part one is here: http://twan.home.fmf.nl/blog/haskell/Knight1.details The overall blog post series (with all four parts) is here: http://twan.home.fmf.nl/blog/ The problem examined is: A knight is placed at the origin of a chessboard that is infinite in all directions. How many ways are there for that knight to reach cell (i,j) in exactly n moves? -- Tracy ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
