The Battle for Wesnoth Forums

What is the concern with the UI? Is the concern that you can't now promise to show crazy long path to a user, because you may change it slightly to accommodate a hoard of units? The problem is forcing the player to make boring micromanagement path finding decisions to route a large army over a long ...

I agree with you. I think your heuristics are nice. I brought the multiple unit path finding problems up in IRC a few months ago. The general sentiment was that when you need to move a large army uncontested through a big area, it likely represents a flaw the the underlying scenario. If you take a s...

I am currently trying to improve the order units are choosen when cycling through next and for healing. See the idea and the patch . In reading the unit_map discussion, I realize that I have no idea about the semantics of unit_map. What kind of containers of units can you keep? Can you hash them? Wh...

The current implementation is using integers. The problem is that the "clear" step destroys all of the order information. Assinging the order at the start of move would work alright I guess, except it would still need to handle when new units join your side as the turn progresses. I guess ...

I have a patch that implements "select next closest uncycled unit" correctly. The problem is that previous unit kind loses its meaning. My current implementation works like this. NextUnit() { if all units are marked { unmark all units select and mark the bottomleft most unit next_mark = 1 ...

Surely your emacs doesn't misbehave like mine does. For example, when I complete a function definition, the code gets pushed way left, because emacs thinks it should be nested only one level instead of two.

Does anyone who edits wesnoth's C++ code use emacs? Emacs has it's own (very different) ideas about the style of the code than my defaults, and it's doing automatic indentation of code against the grain. It's frustrating me and wasting my time. Is there a set style I can use from emacs that will mak...

I think it's a great idea. I love to watch videos of (professional) starcraft at http://youtube.com/group/starcraft . I think walkthroughs with dubbed audio could be really entertaining.

Furthermore, if we assume the sum of the distributions are normal, then we can figure out how unlucky a person is by comparison to the normal. I'm not too comfortable with this assumption, though given that the Central Limit Theorem applies only to iid r.v.'s. By the initial text at http://mathworl...

Wow, I was so off. I see now that you want to calculate the variance of say, 4 attacks with damage 5 and chance to hit of 60% along with 3 attacks with 2 damage and 70% chance to hit, and not the variance of attacks doing damage 5,5,5,0,3,0. Hopefully I am less clueless in this post ;). Why would yo...

What is wrong with algorithm 1 at wikipedia?

http://en.wikipedia.org/wiki/Algorithms ... g_variance

You can keep O(1) memory and output variance in O(1) time in an online fashion by just keeping track of the number of events, the sum of the events, and the sum of the events squared.

It gives you an estimate of how biased the spread between the expectation and actual value is. If the actual damage dealt for your attacks is more than 3 standard deviations above the mean, you can be fairly confident that you have taken advantage of luck. Still, I do agree that an unweighted averag...

Maybe you should post this to comp.lang.python and see what they say?

Yeah, I will implement nearest neighbors, once I get some free time.

From

http://en.wikipedia.org/wiki/Travelling ... an_problem

"In 2D Euclidean TSP, NN algorithm result in a length about 1.26*(optimal length)."

First, let me say that I love wesnoth.

Are there any quality open source TBS games with honest ranged units and area of effect spells? What about just TBS games in general? Is it that hard to do right? Is it just KISS that made wesnoth have the "ranged attacks must be adjacent feature?"