gilmatic, are you french and not so young ?

I was getting the same thing. For Python 3.x, use a//b instead of a/b to handle the float to int problem.

It's a binomial coefficient often used for statistical distributions: https://en.wikipedia.org/wiki/Binomial_coefficient

Init is the starting value.

Lol yeah they are but they're so much fun :D

The battlefield (to be exact, the part where lightning strikes) looks like this:

        →      →        →      →
  None  | None | Sprite | Wolf | Dwarf
--------------------------------------   ↓
Peasant | None |  None  | Wolf | Titan   
        ←      ←        ←      ←

Peasant is not under a dwarf, titan is.

The lighting always begins moving from left to right regardless of where it begins (in this case, it's starting in the secondn row, at array[1][3]. Because of this, it never reaches the peasant: Starting at arr[1][3], it first strikes the opponent's Wolf group. It then moves on to the next target on its right, the Dwarf group (owned by player), then drops down to the next row of the array, striking the player's Titans (but not dealing enough damage to kill one), and, now moving left, finally striking the player's Wolf group, killing one.

Sorry if this was confusing :)

No reason not to ask questions.. that's what the discussion's here for :)

Thanks.

but it will always end. ;)

No. You may have to increase to 21+. This is not very efficient, but you will understand the problem.

A basic approach is trial and error. Run each number for 10 or 20 cycles and see if it becomes 1.