One important point from the original problem statement, which may be a way to reduce the amount of work, is that any NxM rectangle can be tiled by triominos as long as 0=3|N*M.
On Tue, Dec 15, 2009 at 11:38 AM, Devon McCormick <[email protected]>wrote: > It's at http://projecteuler.net/index.php?section=problems&id=161 . > > Basically, given "triominos" like this: > > ]trioms=. ~.,(|:@:|. ; |: ; ] ; |."1) &> (>'X';'XX');,:'XXX' > +--+--+--+--+-+---+ > |XX|XX|X | X|X|XXX| > |X | X|XX|XX|X| | > | | | | |X| | > +--+--+--+--+-+---+ > > ... > -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
