Originally posted by Hagalaz
If that's the issue, why not solve it with simple vectors? Assign "threat" values to each incoming defender and "importance" value to your goal, each of these is the length of a vector, add all 3 and the HB suddenly knows the instant best way considering all defenders at once. It doesn't consider blockers, but it's a pretty simple solution. It even considers backpeddling if the defender threat value goes beyond the "reward" or "importance" value of maintaining the same general direction.
Was used in one of the best bots of all time back in the 90s in quake 1 with great success!
If the defender is threatening enough and fast enough, and the situation dire enough (no time on the clock, for instance)....could be pretty humorous
If that's the issue, why not solve it with simple vectors? Assign "threat" values to each incoming defender and "importance" value to your goal, each of these is the length of a vector, add all 3 and the HB suddenly knows the instant best way considering all defenders at once. It doesn't consider blockers, but it's a pretty simple solution. It even considers backpeddling if the defender threat value goes beyond the "reward" or "importance" value of maintaining the same general direction.
Was used in one of the best bots of all time back in the 90s in quake 1 with great success!
If the defender is threatening enough and fast enough, and the situation dire enough (no time on the clock, for instance)....could be pretty humorous