How many Iteration before Collision? Kangaroo Like

[JackMazzoni]

Estimate how many iteration needed to collide. This is not traditional kangaroo. The Wild can move forward and backward. The Tame can move forward and backward. The problem is 135 bit puzzle. Total Wild is 1.9 trillion  and Tame is 1.9 trillion.  Wild to wild not possible and tame to tame is also not possible. Only Tame and Wild can collide. Not using distinguished points.  Estimate how many iteration or average iteration to collide wild and tame? Does birthday paradox still applies? I tried with 5 different AI, all different answers.

[snaz3d]

I think 12

[JackMazzoni]

I think 12

I think that is too low. Collision happens only to wild and tame.

[kTimesG]

I think 12

I think that is too low. Collision happens only to wild and tame.

Here's the correct answer, in line with how you stated your problem parameters:

Between zero iterations and an infinite iterations. Because you can't know if a collision will ever occur (even if you find a way to store all the visited points, which is already the #1 limiting and bottleneck factor anyway). You may also get lucky and hit the target when your first Tame gets born.

You seem to ask the same question over and over, when you should have already had the answer if you'd actually spend 5 minutes to do some basic math, instead of asking stupid questions without any actual context whatsoever.

[JackMazzoni]

I think 12

I think that is too low. Collision happens only to wild and tame.

Here's the correct answer, in line with how you stated your problem parameters:

Between zero iterations and an infinite iterations. Because you can't know if a collision will ever occur (even if you find a way to store all the visited points, which is already the #1 limiting and bottleneck factor anyway). You may also get lucky and hit the target when your first Tame gets born.

You seem to ask the same question over and over, when you should have already had the answer if you'd actually spend 5 minutes to do some basic math, instead of asking stupid questions without any actual context whatsoever.

I want to know the average collision. There too many visited points it impossible to store them all.

[kTimesG]

I want to know the average collision. There too many visited points it impossible to store them all.

Puzzle 135 is 134 bits, so if you don't screw up the parameters and the algorithms, then you can expect somewhere around 2**66 to 2**68 group operations until the first collision. It can be more, or it can be less. In terms of cost, you're looking at somewhere between 100k and 1 million $, depending on luck.