Prince Zara in the corner
- Thread starter elitetroops
- Start date
pigswill
fly (one day)
That was pretty convincing 
.
.
elitetroops
Deity
- Joined
- Dec 23, 2012
- Messages
- 5,725
Very impressive win! Congrats! 
I'm glad this map sparked so much interest. Great to see how even the worst circumstances can be dealt with with some creativity (and a lot of strong play)!
It seems on this map Vicky suffers from the bug that prevents the AI from building workboats on small lakes. Which leaves her without food in capital until calendar..
I'm glad this map sparked so much interest. Great to see how even the worst circumstances can be dealt with with some creativity (and a lot of strong play)!
It seems on this map Vicky suffers from the bug that prevents the AI from building workboats on small lakes. Which leaves her without food in capital until calendar..
aitkensam
Warlord
These types of difficult situations on lower levels are really fun imho. I used to scour the forums for games uploaded on monarch/emperor where people were at lib or so and one step away from giving up. Fun to try and pull them back.
Sadly not many left now!
I recently saw @WastinTime do some teleporting tricks in BOTM 161.
Figured this map was a good place for me to learn abit. Didn't see anyone try to teleport over the lake.
The original save was locked, and with buffy03. So I worldbuildered a simmilar corner scenario (might have missplaced something) and did some testing.
I gifted Gondar to Asoka, and filled it with basically every wonder in the game, so that his culture would engulf the corner.
I had hopes that at least the tank standing SE of gondar would teleport 2S1W over the lake.
Unfortunatly, it does not work.
After peace every unit gets teleported to Aksum:
When units teleport, they are moved to the tile with the lowest "Jumpcost"
This is calculated as follows:
Jump-Cost = 2*Jump-Distance + Distance2NearestCity
(Distances uses plotDistances which are calculated with this code:
inline int plotDistance(int iX1, int iY1, int iX2, int iY2)
{
iDX = xDistance(iX1, iX2);
iDY = yDistance(iY1, iY2);
return (std::max(iDX, iDY) + (std::min(iDX, iDY) / 2));
}
So for the SE tank, Jump-Cost back to Aksum is 2*(4+2/2)+0 = 10.
Jump-Cost over the lake S of Gondar is 2*2 + 6 = 10.
*EDIT* NO, the tile over the lake here is in Indian culture, and not eligable for teleportation. */EDIT*
The Jump-Cost is the exact same, and I don't know what the tiebreaker is.
Probably the code iterates over all tiles like you read letters in a book, starting in the NW corner and moving eastwards, moving one row down once you reach the end.
So if we would have a simmilar situation with Zara trapped in the SE corner, we might possibly escape with a teleport.
Figured this map was a good place for me to learn abit. Didn't see anyone try to teleport over the lake.
The original save was locked, and with buffy03. So I worldbuildered a simmilar corner scenario (might have missplaced something) and did some testing.
I gifted Gondar to Asoka, and filled it with basically every wonder in the game, so that his culture would engulf the corner.
I had hopes that at least the tank standing SE of gondar would teleport 2S1W over the lake.
Unfortunatly, it does not work.
After peace every unit gets teleported to Aksum:
When units teleport, they are moved to the tile with the lowest "Jumpcost"
This is calculated as follows:
Jump-Cost = 2*Jump-Distance + Distance2NearestCity
(Distances uses plotDistances which are calculated with this code:
inline int plotDistance(int iX1, int iY1, int iX2, int iY2)
{
iDX = xDistance(iX1, iX2);
iDY = yDistance(iY1, iY2);
return (std::max(iDX, iDY) + (std::min(iDX, iDY) / 2));
}
So for the SE tank, Jump-Cost back to Aksum is 2*(4+2/2)+0 = 10.
Jump-Cost over the lake S of Gondar is 2*2 + 6 = 10.
*EDIT* NO, the tile over the lake here is in Indian culture, and not eligable for teleportation. */EDIT*
The Jump-Cost is the exact same, and I don't know what the tiebreaker is.
Probably the code iterates over all tiles like you read letters in a book, starting in the NW corner and moving eastwards, moving one row down once you reach the end.
So if we would have a simmilar situation with Zara trapped in the SE corner, we might possibly escape with a teleport.
Last edited:
Did a simmilar test, but in the lower east corner.
Turns out you end up in the city as well?
This makes me wonder what the tiebreaker is, when Jump-Distances are equal.
Will Swordman teleport 2N 1E, or back to town? "Jump-Distance should be 10 in both cases.
Swordman goes back to town.
Turns out you end up in the city as well?
This makes me wonder what the tiebreaker is, when Jump-Distances are equal.
Will Swordman teleport 2N 1E, or back to town? "Jump-Distance should be 10 in both cases.
Swordman goes back to town.
I realized I did a horrible mistake in the first test. Asokas culture goes way out over the lake... >_<
I did the test again with culture just over the lake:
Lo and behold! The tank teleports over!
I'm guessing that the code just iterates over all tiles, and the one with the lowest Jump-Value is saved, and perhaps the code does a "Equal or less" comparisson? Or it just iterates over the tiles in some manner that I don't understand.
I'm quite sure that the teleport mechanic can't really be used in this game.
If we didn't play a creative leader, perhaps one could work something out.
Very fun map to try out in any case!
Thanks @elitetroops !
I did the test again with culture just over the lake:
Lo and behold! The tank teleports over!
I'm guessing that the code just iterates over all tiles, and the one with the lowest Jump-Value is saved, and perhaps the code does a "Equal or less" comparisson? Or it just iterates over the tiles in some manner that I don't understand.
I'm quite sure that the teleport mechanic can't really be used in this game.
If we didn't play a creative leader, perhaps one could work something out.
Very fun map to try out in any case!
Thanks @elitetroops !
elitetroops
Deity
- Joined
- Dec 23, 2012
- Messages
- 5,725
It iterates over all tiles and the lowest value is saved. Iteration starts from x=0, y=0 which is the SW corner. I believe it first checks the bottom row W->E, then one row north W->E and so on. In case of equal distance it picks the first one the iteration came across.
Similar threads
