Raul Miller wrote: > On 5/25/07, Terrence Brannon <[EMAIL PROTECTED]> wrote: >> Dont give up Raul. > > What, am I the only person who can solve this? >
Since my problem-solving efforts are currently directed at Project Euler #156, I have not got far with this. Here is my plan. For each piece, find all possible placements on the board. Represent these as bit vectors with 50 elements, each stored in a single 64-bit integer. A combination of placements is illegal if the bitwise and of the corresponding integers is nonzero. Do depth-first search on legal lists of configurations for each piece. This may well not work out, but that is my initial idea. I read the Java article. The approach there is probably not appropriate for J: it requires too many small decisions. I have not read the shootout solutions. Best wishes, John ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
