Re:How to Crack the Toughest Coding Interviews
by jsolson on Friday October 26, 2012 @11:18PM
(#4705232)
So, the professor in question was Dana Randall. I believe she was talking about this topic: http://en.scientificcommons.org/42983059
Basically, yes, self-avoiding paths.
This was basically a brief aside in her honors undergrad algorithms course, so the topic was a bit beyond what I was prepared for at the time :)
Re:How to Crack the Toughest Coding Interviews
by Someone on Saturday October 27, 2012 @05:17AM
(#4705798)
I wasn't assuming, I was following what the OP wrote: "by going only up or right one point with each move (that is, each move is either (0,1) or (1,0)))" for 3D.
Counting self-avoiding walks is hard in 2D, too (http://oeis.org/A007764)
http://en.wikipedia.org/wiki/Self-avoiding_walk