25.10.2017, 22:16
For me now it looks like this (don't shoot the piano player
)
We have the system with N objects, each of them can be in one of _three_ states:
0 - not fired, 1 - now fired, 2 - burned.
And we have to count _number_of_paths_ from (0,0,..0) to (2,2,..2)
And some paths are forbidden, because they don't produce "overlap".
)We have the system with N objects, each of them can be in one of _three_ states:
0 - not fired, 1 - now fired, 2 - burned.
And we have to count _number_of_paths_ from (0,0,..0) to (2,2,..2)
And some paths are forbidden, because they don't produce "overlap".