I've read in previous posts that this problem is about dynamic pogramming, LIS. But I can't see how i can apply LIS to this problem. And why do you sort by strength then by weight? I think we have to take into account the residual strength.
Please give me some hint to get to the solution.
Search found 6 matches
Search found 6 matches • Page 1 of 1
- Thu Dec 11, 2003 3:18 am
- Forum: Volume 100 (10000-10099)
- Topic: 10001 - Garden of Eden
- Replies: 39
- Views: 14969
Hi: I am trying to solve this problem by exhaustive search. To do it, i try to prune some states. I mean: I generate sequences like (for 4 cells): 0000 0001 0010 0011 0100 ..... while i am generating next state for every cell, if i find some state which doesn't match i don't follow generating and i ...