Thanks for the tool, I've tested it. It seems that anytime a point resides in the second half of a range, it never gets to it. Something is wrong here!
Any proofs? Last guy who told me that my app does not work just missed zero in range number

you solved puzzle 130 two years ago within 2 months, by now you prolly have more advanced hardwares, and with time much more improved algorithms. So now if you were to be given another puzzle in same range like #130, how long will it take for you to crack it? Prolly 1 Month I think?
Yeah I improved my software after solving #130, and I'm going to make it open source.
Hi @RetiredCoder, I have a technical question for you. In your code, you use two wild kangaroo herds. What do you think about adding two more wild herds that would be symmetric with respect to half of the search range?
For example, suppose the range is from 0 to 10. The first wild herd starts at 7, and the second wild herd is calculated by the formula 7 − end(10) = 3. Suppose they meet at point 9: the first herd (starting at 7) has traveled a distance of 2, while the second herd (starting at 3) has traveled a distance of 6. The key could then be computed as (end + 6 − 2) / 2 = 7 or (end + 2 − 6) / 2 = 3.
Does adding new types of herds increase the probability of a collision?
What you say is not a new type of herd, it's the same type, just with shifted/additional range.
You can try to add/change ranges for all three types of kangs (tame, wild1, wild2) to get lower K, though I have reasons to doubt that it will help.
If you could add fourth kang type with similar range (wild3) it would help
