3rd party Apps wishlist

[Gandalf Parker]

Secondly, ripping the unit icons to .tga format.

this would be awesome! hope someone is up to it


I keep waiting for someone to just make some unit sheets. Anyone can do that with screen capture and a paint program (and more patience than I have). Even if they did them one group at a time it would help.

[Davidious]

I keep waiting for someone to just make some unit sheets. Anyone can do that with screen capture and a paint program (and more patience than I have). Even if they did them one group at a time it would help.

as pointed out in another topic, just doing it that way requires some touch up as well and we're talking LOTS of pictures, so tons of work.

plus I'd really like to get the 'action' pose .tga 's and I don't think there's an easy way to do that without extracting the pictures.

[Leif_-]

Originally posted by Davidious:

quote:

---

I keep waiting for someone to just make some unit sheets. Anyone can do that with screen capture and a paint program (and more patience than I have). Even if they did them one group at a time it would help.

as pointed out in another topic, just doing it that way requires some touch up as well and we're talking LOTS of pictures, so tons of work.

plus I'd really like to get the 'action' pose .tga 's and I don't think there's an easy way to do that without extracting the pictures.

---

Well, if you start Dominions with the -xxx option, you should get a completely black battle-field; which should reduce the amount of touch-up you'll need. Of course, if you want _both_ images of the unit (standard and attack) you're in for some work.

[Gandalf Parker]

Originally posted by Leif_-:
Well, if you start Dominions with the -xxx option, you should get a completely black battle-field; which should reduce the amount of touch-up you'll need. Of course, if you want _both_ images of the unit (standard and attack) you're in for some work.

Some work. But from what Ive seen it looks like moving one small section and maybe some pixel editing. I mean the barbarain chief moves his sword from above his head to out in front of him.

[Hozzy]

I'm not even sure this could be done, I'd like to have a app that would keep a record of your top ten or twenty slain commanders. The ranking could be exactly like the Hall of Fame but with all your units...It would make for a great After-The-Game comparison.

[Gandalf Parker]

a watchdog routine for hotseat games that have a slow player. It could watch for the trn files to change and then play a sound.

[Tominator2]

New addition: I didnt think of it because its definetly in an area of programming I do badly at. A 3rd party program which can plot the fastest course from xxx to yyy. Read in the .map file and array the neighbor commands. Work out the shortest route.

Psuedo-code follows:

code:

---

We'll need a queue class "queue" and a list class "path".



The queue class is pretty standard.



The path class is just like a queue, except that it needs to support a "LastArea( )" method, which will return the most recently enqueued

element (addArea is just enq).  Also, it will need a contains(x) method which returns true if the path already contains x.



We'll assume that:

- areas are represented by numbers

- travel always takes one "turn"

- there is an adjacency function adj(x, y) which returns true if x is adjacent to y, and false otherwise (e.g. return map[x][y]))

- we start in area 0



path start = new path(0);

queue q = new queue;

q.enq(start);



path ans;

ans = findPath(start);



path findPath(queue q, int goalArea) {

    path curPath = q.deq( );

    int curNode = curPath.LastArea( );

    for (i = 1; i < numAreas; i++) {

        if (adj(curNode, i)) {

            if (i == goalArea) {

                return curPath;

            } else {

                if (!path.contains(i)) {

                    path tmp = new path(curPath);

                    q.enq(tmp.addArea(i));

                }

            }

        }

    }

    

    findPath(q, goalArea);

}

---

There might be a bug or two in the above code - I haven't tested it. In any case, it's a pretty straightforward breadth-first search. It's not nearly as efficient as Dijkstra's algorithm, but it is nice in that it keeps around partial paths (another function might prune a path for some game-related reason). I can't say I know anything about extracting data from .map files.

An addition would be to add terrain and have it avoid either land or water.

A simple change to the adj function.

Or even figure in terrain factors such as flyers and forest-moving units

Now it starts getting complicated, and you'll probably want an A* algorithm. I can do that, if you want to go that way.

[ March 09, 2004, 02:18: Message edited by: Tominator2 ]