Topic: Probability Drive
toptopple![]() Topic Opener |
Posted at:
2016-05-27, 09:03 UTC+2.0
I want to get rid of an idea concerning the foresters and perhaps also the geologists. The idea is to introduce probability to the choice of work targets. This goes like this; The forester has an area of the map to work on and the walk distance to his next target location can be measured, e.g. from 1 to 10. The choice for the next target is taken randomly. But, and this would be new, the choice undergoes a dropping probability. When dropping occurs, a new choice is selected (randomly). The drop probability is a value associated with the target or walking distance, and e.g. may range from 0 at distance 1 until 70 at maximum distance. The proposed measures make the work behaviour of those workers who have to select a target location appear more natural. It also makes more sense in gameplay as the result of a worker's work (e.g. geologist) is more predictable. In my eyes this clearly improves the game and seems not very difficult to implement. Cheers! ![]() ![]() |
kaputtnik![]() |
Posted at:
2016-05-27, 19:59 UTC+2.0
Sorry, but i don't understand what your proposing. What do you mean with:
Why is it now unnatural? The only thing i am stumbled of these days is that the geologist doesn't look for resources in the closest spots nearby the flag where he starts to search for resources. ![]() ![]() |
toptopple![]() Topic Opener |
Posted at:
2016-05-27, 23:37 UTC+2.0
Ok, I have to explain One of the effects is that work is done more efficiently, so through-put is rising for the forester, e.g., also for the the geologist. Second effect is that work results of these workers starts forming a shape, namely concentric circles. How strong this effect comes to life depends on how "steep" or "flat" the probability profile is set. With the work forming a shape it is, e.g., less expensive for the player to put a forester in a corner which is nearer to a mountain. Try it out an see if you like it! ![]() ![]() |
king_of_nowhere![]() |
Posted at:
2016-05-28, 10:51 UTC+2.0
I know that the algorithm should be random, but i often see foresters surrounded by trees, with less trees at higher distances. I wonder if some snag in the code is already creating a similar effect, or if it is only a mix of coincidence and confirmation bias on my part. But really, the difference should be small enough to be virtually unnoticeable. ![]() ![]() |
GunChleoc![]() |
Posted at:
2016-05-29, 12:05 UTC+2.0
I noticed this with the geologists too - it would ineed be nice of closer spots had a higher probability to be targeted by a worker than sports further away. Busy indexing nil values ![]() ![]() |
Tibor |
Posted at:
2016-05-29, 21:17 UTC+2.0
Mathematically, if picking random spot within radius r, average of all spots within that radius is about 0.7r. I mean half of them is closer then 0.7r, and second half is farer than 0.7r. Am I right? ![]() ![]() |
DragonAtma![]() |
Posted at:
2016-05-30, 00:55 UTC+2.0
Area of a circle is pi*r*r.
![]() ![]() |
king_of_nowhere![]() |
Posted at:
2016-05-30, 01:50 UTC+2.0
works with a circle, not sure about a hexagonal grid. let's try to calculate:
ok, it's radius * 3. A circle of radius 10 would have a total of 1 + 1 * 6 + 2 * 6 + 3 * 6 + ... + 10 * 6 = 1 + (55 * 6) = 331 corners. Those outside a radius of 7 are (10 + 9 + Suppose we decrease the chance of being picked by 10% for every step away - but never lower than 0.1 to avoid problems with 0 probability.
Nice inversion of numbers we have there, but i see that every radius between 2 and 7 has a very similar probability. Could be good. EDIT: or maybe it would be simpler to have the worker first pick a radius, then pick a spot with that radius, so all radii would have equivalent probability of being picked.
Edited:
2016-05-30, 01:53 UTC+2.0
![]() ![]() |
GunChleoc![]() |
Posted at:
2016-05-30, 10:00 UTC+2.0
2 notes:
Busy indexing nil values ![]() ![]() |
toptopple![]() Topic Opener |
Posted at:
2016-05-30, 17:19 UTC+2.0
Algorithmical, I suggest to keep what is already there - if it is any good - and only plant the dropping mechanism on top. So it's more easy to do a negative work here instead of a positive You have to keep in mind that the "full house" problem must be avoided, i.e. in case there is no working slot available at all, the algorithm must fade. If the dropping is placed on top of the primary selection, this problem should be done already. For security you could run a loop counter and break the procedure when hit a limit. Nice table of P-values there! For distances 1 and 2 the dropping probability could be 0 (which means the selection maintained 100%). This adds a bit to their stance. Cheers! ![]() ![]() |