Fájl:800px-Mago copy.png - Laptörténet

Csampai: Levédte a(z) Fájl:800px-Mago copy.png lapot ([edit=sysop] (határozatlan) [move=sysop] (határozatlan) [upload=sysop] (határozatlan))

2012-06-28T09:09:46Z

Levédte a(z) Fájl:800px-Mago copy.png lapot ([edit=sysop] (határozatlan) [move=sysop] (határozatlan) [upload=sysop] (határozatlan))

2012-06-28T09:09:42Z

Visszavontam 188.143.232.12 (vita | szerkesztései) szerkesztését (oldid: 5433)

2012-06-28T02:02:23Z

NaoqrTFqLLTMTpCm

2012-03-05T13:48:53Z

Új lap

←Régebbi változat		A lap 2012. június 28., 09:09-kori változata
1. sor:		1. sor:
−	70 ms is too long. The KaM tick rate is 100ms, so that's almost all of it gone just for this caoaluctiln. If two players moved soldiers at once the game would lag. We could make this calculated less often as villages change slowly, but even so, it would still lag during the caoaluctiln. (so the game would lag every minute or whenever the caoaluctiln is done)Also, try it with 8 players and larger villages and larger maps with more obstacles I don't know how your algorithm works but if it's checking from every building to every other building then the scaling is N^2, so for N total houses, it must do N^2 comparisons which is bad. (100 houses = 100,000 caoaluctilns, and we'd really like to allow 1,000 houses in one game if possible) And each caoaluctiln involves path finding It's a neat program though, I really like the output. I think we can do something like it but more simple (maybe just with storehouse -> storehouse rather than all houses, the result would still be good)	+

←Régebbi változat	A lap 2012. június 28., 02:02-kori változata
1. sor:	1. sor:
−	+	70 ms is too long. The KaM tick rate is 100ms, so that's almost all of it gone just for this caoaluctiln. If two players moved soldiers at once the game would lag. We could make this calculated less often as villages change slowly, but even so, it would still lag during the caoaluctiln. (so the game would lag every minute or whenever the caoaluctiln is done)Also, try it with 8 players and larger villages and larger maps with more obstacles I don't know how your algorithm works but if it's checking from every building to every other building then the scaling is N^2, so for N total houses, it must do N^2 comparisons which is bad. (100 houses = 100,000 caoaluctilns, and we'd really like to allow 1,000 houses in one game if possible) And each caoaluctiln involves path finding It's a neat program though, I really like the output. I think we can do something like it but more simple (maybe just with storehouse -> storehouse rather than all houses, the result would still be good)