All Activity
- Past hour
-
First look at https://gitea.wildfiregames.com/0ad/0ad/src/branch/main/binaries/data/mods/public/simulation/components/UnitAI.js I think the first thing you will need is some tools that allow you to quickly search for a certain keyword in ALL files in 0AD. For example, inside UnitAI.js you would see cmpAttack.IsTargetInRange, then you need to search for where is it defined. You will be keep moving between many files, and up and down within a 5000 lines file. You will easily get lost if you don't have a convenient tool. I personally use Emacs, but I don't think you will want that. Perhaps ask ChatGPT if they have better tools suggestion for you.
- Today
-
Why is there no hero Arminius for the Germanic civilization?
Barade replied to Barade's topic in General Discussion
Thx for the clarification. I was already suspecting something like this. It's a bit sad for me that they are not part of the Germanic civilization since they are probably the most famous tribe for the average player. -
ThomasKam joined the community
-
campaign empty(help, how do i get campaign mode)
Nicolaus_von_Kues replied to zaza's topic in General Discussion
-
they ALSO have a massive damage multiplier on top of all that. also,all ranged cav has one extra pierce resistance than their infantry counterparts. combine this with the extra hp and mobility and you have the best unit for survivability
-
Settlements conceptual art.
Nicolaus_von_Kues replied to Nicolaus_von_Kues's topic in Tutorials, references and art help
- Yesterday
-
Frankycligo joined the community
-
Asher started following AI Scripting Help for Scouting Mod
-
So I am trying to make certain structures "invisible" to bot players. My idea is to change the code in the file that checks for the nearest structure, and make it so it only sets that as attack point if the structure is not a certain class. I don't know if that would be easy, I think it would be somewhat easy. If someone could point me to where the file is and where in the file that would be, that would be helpful. I may also need help with the coding, if anybody would want to help. Thanks!
- 1 reply
-
- 1
-
-
It can be implemented progressively, starting with a non-editable version generated by a script.
-
played multiple 5v5, one 6v6 with others here, and I can say its pretty darn smooth than expected! quite good compared to what everyone would assume it to be... and @kheeva I had the mod installed and I also could not join his 1v1.. it seems to be problem of him.. I am currently in the game you are playing haha even though its without the mod
-
There is a way to make mods not required on for everyone, like bigger mini map, or what you were saying. It changes how the mini map looks for me, but not everyone needs it, I wonder if that could work for this. I'm just not sure how to do it Sorry, I think I took out a word or 2. What I was saying was, you are right. More teams is kinda useless, maybe except for 5-6 teams, in some specific situations
-
image u joined as a new player. u should install feldmap, extraplayers, otherverycoolmodfromnowhere. cool if mods dont break ability to play without them, otherwise this mods considered harmful
-
I don't understand the argument. The difficulty of AIs is independent of teams.
-
the more mods the less new players. i couldnt spec Appa02's 1v1 coz of unknown network error. He had this mod installed. I think mods should not break back compatibility, otherwise they kill this game.
-
Settlements conceptual art.
Nicolaus_von_Kues replied to Nicolaus_von_Kues's topic in Tutorials, references and art help
Playing around with some ideas. It contains a well. 3 main buildings: perhaps dwellings/houses. A chicken coop or corral. And perhaps a basic watchtower similar to an outpost. -
You mean the overlap of fields you see in game? They actually are not overlapping. The "core" part of a field is smaller, and I'm computing based on that core part only. In game, they render a bit more field outside of that core part. That part cannot be farmed, and is for aesthetic effect only.
-
You are not considering Field overlapping?
-
RichardTox started following when update?
-
Six months has passed. Development of stevenlauBot did not stop, but I have been dealing with a really difficult problem - optimal field placement around CC. The algorithm improved over and over, and now reaches an optimal solution worth sharing. Before I go into technical details, here are some screenshots of optimal placements in random Mainland. Pink represents the region where we can place field freely, and blues are the fields. Now I am writing some technical details. I first define Gap and Hang. Gap Ideally we want to let a field to touch (snap) the CC (or actually any dropsite), so that farmers can efficiently drop resources without walking. However, since farmers have a size and dropping range, we can actually leave a gap (around 5.6m) between field and CC and the farmer can still drop resources without walking. Leaving such a gap might allow more fields to be placed. Hang In games, we often see players put field snapping at the corner of CC. This is not ideal, because farmers will have a walk a bit to drop resources. We name this case "hanging" entirely outside of CC. If we now shift that field a little inward toward the CC, it is still hanging, but only part of it is hanging. Then farmers can farm in the part where the field is not hanging, and they can drop resources without walking. That non-hanging part is around 8m. Now to state our problem more precisely, we want to place maximum number of fields around CC, allowing gap between CC, but keep certain non-hanging part. We disallow rotation. Although rotation might give better arrangement, the problem will become too difficult. In fact, disallowing rotation is the sole assumption of our algorithm. Under such assumption, our algorithm gives optimal placement. I also claim that if we allow rotation, no efficient algorithm exists. People who are familiar with algorithm, especially computational geometry, should realise this is a very difficult problem. This is shape arrangement in continuous 2D space, and deterministic algorithm might not even exist. Scientists usually do heuristics to find good-enough (but not optimal) solution in these problems. I had also been working on heuristics, but as I keep improving my heuristics, I found that our problem is quite special and is much simplified. It turned out that we can work out a combinatorial algorithm to really find the optimal placement. We basically do trapezoidal decomposition of the region, that we do sweep line algorithm over all such trapeziums, exhaust all combinations, and merge linearly related constraints. The algorithm is super complicated, but I think I made it. Do you like it?
-
Latest Topics
