Difference between revisions of "FormulaAI Functions"
m |
(Move core functions to new Wesnoth Formula Language page) |
||
Line 24: | Line 24: | ||
Also function may return only single argument, or be able to return a whole list or a map. | Also function may return only single argument, or be able to return a whole list or a map. | ||
− | There are a wide variety of functions which can be used to accomplish many different tasks. You can also [http://www.wesnoth.org/wiki/ | + | There are a wide variety of functions which can be used to accomplish many different tasks. You can also [http://www.wesnoth.org/wiki/Wesnoth Formula Language#Functions define your own functions]. |
− | + | In addition to the functions listed here, there are several [[Wesnoth Formula Language#Core Functions|core functions]] available. | |
− | = | + | = Base functions = |
− | + | = 'attack' function = | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<action> = attack( <attacker's position>, <destination>, <attack location> [, <weapon> ] ) | <action> = attack( <attacker's position>, <destination>, <attack location> [, <weapon> ] ) | ||
Line 377: | Line 36: | ||
The first three parameters are locations. At the begining, unit which is standing at <attacker's position> is moved to <destination> place. Then, from that place unit is attacking unit which stands in place marked by <attack location>. Fourth optional parameter is number, and indicates which weapon attacker should use - if not specified, best possible weapon is chosed automatically. | The first three parameters are locations. At the begining, unit which is standing at <attacker's position> is moved to <destination> place. Then, from that place unit is attacking unit which stands in place marked by <attack location>. Fourth optional parameter is number, and indicates which weapon attacker should use - if not specified, best possible weapon is chosed automatically. | ||
− | + | = 'fallback' function = | |
<action> = fallback( [<name>] ) | <action> = fallback( [<name>] ) | ||
Line 389: | Line 48: | ||
fallback( 'human' ) | fallback( 'human' ) | ||
− | + | = 'get_unit_type' function = | |
<unit> = get_unit_type( <unit name> ) | <unit> = get_unit_type( <unit name> ) | ||
Line 399: | Line 58: | ||
will result in returning unit_type of a Mage. | will result in returning unit_type of a Mage. | ||
− | + | = 'move' function = | |
<action> = move( <source> , <destination> ) | <action> = move( <source> , <destination> ) | ||
Line 409: | Line 68: | ||
will make leader move one hex north. Leader's movement points will be reset to 0. | will make leader move one hex north. Leader's movement points will be reset to 0. | ||
− | + | = 'move_partial' function = | |
<action> = move_partial( <source> , <destination> ) | <action> = move_partial( <source> , <destination> ) | ||
Line 420: | Line 79: | ||
− | + | = 'run_file' function = | |
<formula> = run_file( <string_file_location> ) | <formula> = run_file( <string_file_location> ) | ||
Line 429: | Line 88: | ||
At the moment, this function is useful mainly for debugging from the game console. | At the moment, this function is useful mainly for debugging from the game console. | ||
− | + | = 'set_unit_var' function = | |
<action> = set_unit_var( <key>, <value> , <location>) | <action> = set_unit_var( <key>, <value> , <location>) | ||
Line 436: | Line 95: | ||
− | + | = 'set_var' function = | |
<action> = set_var( <key> , <value> ) | <action> = set_var( <key> , <value> ) | ||
Line 446: | Line 105: | ||
Will create variable with name 'Number one' and assign 1 to it. | Will create variable with name 'Number one' and assign 1 to it. | ||
− | + | = Evaluation = | |
− | + | == 'calculate_outcome' function == | |
[<list of outcomes>] = calculate_outcome(<attacker current location>, <attacker location> , <defender location> , [<weapon>] ) | [<list of outcomes>] = calculate_outcome(<attacker current location>, <attacker location> , <defender location> , [<weapon>] ) | ||
Line 455: | Line 114: | ||
if no weapon is provided, it will return for the weapon considered the best by the C++ weapon choice algorithm (the one used to select default weapon in normal games) | if no weapon is provided, it will return for the weapon considered the best by the C++ weapon choice algorithm (the one used to select default weapon in normal games) | ||
− | + | == 'chance to hit' function == | |
<number> = chance_to_hit( <unit> , <location> ) | <number> = chance_to_hit( <unit> , <location> ) | ||
Line 466: | Line 125: | ||
− | + | == 'evaluate_for_position' function == | |
<variant> = evaluate_for_position(<position>, <formula> ) | <variant> = evaluate_for_position(<position>, <formula> ) | ||
Line 472: | Line 131: | ||
Returns the result of <formula> as if <formula> was evaluated with a position of <position> instead of the current position | Returns the result of <formula> as if <formula> was evaluated with a position of <position> instead of the current position | ||
− | + | == 'max_possible_damage' function == | |
<number> = max_possible_damage( <attacking unit> , <defending unit> ) | <number> = max_possible_damage( <attacking unit> , <defending unit> ) | ||
Line 478: | Line 137: | ||
Function returns highest possible damage that <attacking unit> can inflict to <defending unit>. | Function returns highest possible damage that <attacking unit> can inflict to <defending unit>. | ||
− | + | == 'max_possible_damage_with_retaliation' function == | |
<number> = max_possible_damage_with_retaliation( <attacking unit> , <defending unit> ) | <number> = max_possible_damage_with_retaliation( <attacking unit> , <defending unit> ) | ||
Line 488: | Line 147: | ||
in which first two elements are highest possible damage that <attacking unit> can inflict to <defending unit> with melee and ranged attacks, and latter two elements are highest possible damage that <defending unit> can inflict to <attacking unit> also with melee and ranged attacks. | in which first two elements are highest possible damage that <attacking unit> can inflict to <defending unit> with melee and ranged attacks, and latter two elements are highest possible damage that <defending unit> can inflict to <attacking unit> also with melee and ranged attacks. | ||
− | + | == 'movement_cost' function == | |
<number> = movement_cost( <unit> , <location> ) | <number> = movement_cost( <unit> , <location> ) | ||
Line 498: | Line 157: | ||
shows what movement cost your leader has in a place he is currently standing on. | shows what movement cost your leader has in a place he is currently standing on. | ||
− | + | == 'next_hop' function == | |
[<location>] = next_hop( src,dst, [unit_location]) | [<location>] = next_hop( src,dst, [unit_location]) | ||
this function returns the 'next hop' location to move for the unit at unit_location standing at src if it wants to move to dst. if unit_location is omitted, it defaults to src. | this function returns the 'next hop' location to move for the unit at unit_location standing at src if it wants to move to dst. if unit_location is omitted, it defaults to src. | ||
− | + | == 'outcomes' function == | |
[<list of positions>] = outcomes( <attack> ) | [<list of positions>] = outcomes( <attack> ) | ||
Line 515: | Line 174: | ||
− | + | == 'timeofday_modifier' function == | |
<number> = timeofday_modifier(<unit> [, <location>] ) | <number> = timeofday_modifier(<unit> [, <location>] ) | ||
Line 525: | Line 184: | ||
location - location for which to evaluate (optional, defaults to unit's current location) | location - location for which to evaluate (optional, defaults to unit's current location) | ||
− | + | = Gamemap functions = | |
− | + | == 'adjacent_locs' function == | |
<loc list> = adjacent_locs( <location> ) | <loc list> = adjacent_locs( <location> ) | ||
Line 535: | Line 194: | ||
− | + | == 'castle_locs' function == | |
[<loc list>] = castle_locs(<location>) | [<loc list>] = castle_locs(<location>) | ||
Line 542: | Line 201: | ||
given a hex, this function will return the list of all locations that is connected to <location> only by keeps or castle. I.e the hexes you can recruit from, assumin that you are at a keep at <location> | given a hex, this function will return the list of all locations that is connected to <location> only by keeps or castle. I.e the hexes you can recruit from, assumin that you are at a keep at <location> | ||
− | + | == 'close enemies' function == | |
<units list> = close_enemies( <location> , <distance> ) | <units list> = close_enemies( <location> , <distance> ) | ||
Line 552: | Line 211: | ||
gives back a list of enemies in the distance of 5 tiles or less from the tile (10, 10). | gives back a list of enemies in the distance of 5 tiles or less from the tile (10, 10). | ||
− | + | == 'distance_between' function == | |
<number> = distance_between( <location A> , <location B> ) | <number> = distance_between( <location A> , <location B> ) | ||
Line 562: | Line 221: | ||
will return 3. | will return 3. | ||
− | + | == 'distance_to_nearest_unowned_village' function == | |
<number> = distance_to_nearest_unowned_village( <location A> ) | <number> = distance_to_nearest_unowned_village( <location A> ) | ||
Line 568: | Line 227: | ||
This function returns distance (in hexes) between <location A> and nearest unowned village. | This function returns distance (in hexes) between <location A> and nearest unowned village. | ||
− | + | == 'defense_on' function == | |
<number> = defense_on( <unit> , <location> ) | <number> = defense_on( <unit> , <location> ) | ||
Line 578: | Line 237: | ||
shows how good defense your leader has in a place he is currently standing on. | shows how good defense your leader has in a place he is currently standing on. | ||
− | + | == 'find_shroud' function == | |
<locations list> = find_shroud() | <locations list> = find_shroud() | ||
Line 585: | Line 244: | ||
− | + | == 'is_avoided_location' function == | |
<boolean> = is_avoided_location(map_location) | <boolean> = is_avoided_location(map_location) | ||
This function will return the answer to question 'is location avoided by current ai?' | This function will return the answer to question 'is location avoided by current ai?' | ||
− | + | == 'is_unowned_village' function == | |
<boolean> = is_unowned_village( <map or ai.map> , <location> ) #1 | <boolean> = is_unowned_village( <map or ai.map> , <location> ) #1 | ||
Line 601: | Line 260: | ||
− | + | == 'is_village' function == | |
<boolean> = is_village( <map or ai.map> , <location> ) #1 | <boolean> = is_village( <map or ai.map> , <location> ) #1 | ||
Line 619: | Line 278: | ||
Remember, when using is_village in custom function, you either have to access map by writing 'ai.map', or specify ai as a 'default input'. | Remember, when using is_village in custom function, you either have to access map by writing 'ai.map', or specify ai as a 'default input'. | ||
− | + | == 'loc' function == | |
<location> = loc( <X number>, <Y number> ) | <location> = loc( <X number>, <Y number> ) | ||
Line 625: | Line 284: | ||
Function will return a location (pair of numbers) from two given input arguments. | Function will return a location (pair of numbers) from two given input arguments. | ||
− | + | == 'shortest_path' function == | |
<list of locations> = shortest_path( <location A> , <location B> [, <unit location> ] ) | <list of locations> = shortest_path( <location A> , <location B> [, <unit location> ] ) | ||
Line 631: | Line 290: | ||
When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function takes into account zone of control of enemy units. | When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function takes into account zone of control of enemy units. | ||
− | + | == 'simplest_path' function == | |
<list of locations> = simplest_path( <location A> , <location B> [, <unit location> ] ) | <list of locations> = simplest_path( <location A> , <location B> [, <unit location> ] ) | ||
Line 637: | Line 296: | ||
When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function does not take into account zone of control or enemy units. | When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function does not take into account zone of control or enemy units. | ||
− | + | == 'suitable_keep' function == | |
<keep location> = suitable_keep( <input location> ) | <keep location> = suitable_keep( <input location> ) | ||
Function returns location of nearest keep to the unit which is located specified <input location>.It takes a location on which a unit is standing, and returns, in order of decreasing preference: nearest (by pathfinding) empty keep reachable by that unit within 1 turn, nearest (by pathfinding) occupied keep reachable within 1 turn, result of nearest_keep() implementation, null location. | Function returns location of nearest keep to the unit which is located specified <input location>.It takes a location on which a unit is standing, and returns, in order of decreasing preference: nearest (by pathfinding) empty keep reachable by that unit within 1 turn, nearest (by pathfinding) occupied keep reachable within 1 turn, result of nearest_keep() implementation, null location. | ||
− | + | == 'unit_at' function == | |
<unit> = unit_at( <location> ) | <unit> = unit_at( <location> ) | ||
Line 650: | Line 309: | ||
unit_at( loc( 4, 4) ) | unit_at( loc( 4, 4) ) | ||
− | + | == 'nearest_keep' function == | |
<keep location> = nearest_keep( <input location> ) | <keep location> = nearest_keep( <input location> ) | ||
Line 656: | Line 315: | ||
Function returns location of nearest keep to the specified <input location>, or null if there is no keep on the map. | Function returns location of nearest keep to the specified <input location>, or null if there is no keep on the map. | ||
− | + | == 'nearest_loc' function == | |
<keep location> = nearest_keep( <input location>, <list of locations> ) | <keep location> = nearest_keep( <input location>, <list of locations> ) | ||
Line 663: | Line 322: | ||
For example, " nearest_loc(loc(17,7),map(my_units,self.loc)) " - returns the location of a player-owned unit which is nearest to location (17,7) | For example, " nearest_loc(loc(17,7),map(my_units,self.loc)) " - returns the location of a player-owned unit which is nearest to location (17,7) | ||
− | + | == 'unit_moves' function == | |
<locations list> = unit_moves( <unit location> ) | <locations list> = unit_moves( <unit location> ) | ||
Line 669: | Line 328: | ||
Function returns list of all possible locations which unit standing at <unit location> can reach. If unit can't move, or there is no unit standing at given location, empty list is returned. | Function returns list of all possible locations which unit standing at <unit location> can reach. If unit can't move, or there is no unit standing at given location, empty list is returned. | ||
− | + | == 'units_can_reach' function == | |
<units list> = units_can_reach( <possible moves list>, <location> ) | <units list> = units_can_reach( <possible moves list>, <location> ) | ||
Line 675: | Line 334: | ||
Function takes as an input list of possible moves ( ai.my_moves for units that belong to AI, or ai.enemy_moves for units that belong to the opponent ) and checks which units from that list can reach <location>. | Function takes as an input list of possible moves ( ai.my_moves for units that belong to AI, or ai.enemy_moves for units that belong to the opponent ) and checks which units from that list can reach <location>. | ||
− | + | = Recruitment = | |
− | + | == 'recruit' function == | |
<action> = recruit( <unit name> [, <location> ] ) | <action> = recruit( <unit name> [, <location> ] ) |
Revision as of 23:02, 4 March 2016
Warning |
Formula AI is still functional for the time being, but it is not maintained any more.
That applies to both the code and these wiki pages. |
See also: Formula_AI_Howto
Contents
- 1 Overview
- 2 Base functions
- 3 'attack' function
- 4 'fallback' function
- 5 'get_unit_type' function
- 6 'move' function
- 7 'move_partial' function
- 8 'run_file' function
- 9 'set_unit_var' function
- 10 'set_var' function
- 11 Evaluation
- 11.1 'calculate_outcome' function
- 11.2 'chance to hit' function
- 11.3 'evaluate_for_position' function
- 11.4 'max_possible_damage' function
- 11.5 'max_possible_damage_with_retaliation' function
- 11.6 'movement_cost' function
- 11.7 'next_hop' function
- 11.8 'outcomes' function
- 11.9 'timeofday_modifier' function
- 12 Gamemap functions
- 12.1 'adjacent_locs' function
- 12.2 'castle_locs' function
- 12.3 'close enemies' function
- 12.4 'distance_between' function
- 12.5 'distance_to_nearest_unowned_village' function
- 12.6 'defense_on' function
- 12.7 'find_shroud' function
- 12.8 'is_avoided_location' function
- 12.9 'is_unowned_village' function
- 12.10 'is_village' function
- 12.11 'loc' function
- 12.12 'shortest_path' function
- 12.13 'simplest_path' function
- 12.14 'suitable_keep' function
- 12.15 'unit_at' function
- 12.16 'nearest_keep' function
- 12.17 'nearest_loc' function
- 12.18 'unit_moves' function
- 12.19 'units_can_reach' function
- 13 Recruitment
Overview
Syntax used to explain functions usage in this document is:
<result> = <function name>( <comma-separated list of parameters> [, <comma-separated list of optional parameters] )
Function may return <result> as:
- <variable> - any of the supported variable types
- <boolean> - false ( 0 or null ) or true ( 1 )
- <unit> - unit
- <location> - place on a gamemap
- <action> - object, which, if later passed to 'move= ' as the result of formula evaluation, make the AI perform a desired action.
- <result> - any of the above
Also function may return only single argument, or be able to return a whole list or a map.
There are a wide variety of functions which can be used to accomplish many different tasks. You can also Formula Language#Functions define your own functions.
In addition to the functions listed here, there are several core functions available.
Base functions
'attack' function
<action> = attack( <attacker's position>, <destination>, <attack location> [, <weapon> ] )
The first three parameters are locations. At the begining, unit which is standing at <attacker's position> is moved to <destination> place. Then, from that place unit is attacking unit which stands in place marked by <attack location>. Fourth optional parameter is number, and indicates which weapon attacker should use - if not specified, best possible weapon is chosed automatically.
'fallback' function
<action> = fallback( [<name>] )
This function allows to chose different AI or to human player, who will take control over side untill the end of current turn. For example:
fallback()
will transfer control to the default C++ AI. You can specify a name of different AI (for example python_ai) to transfer control to it. If you want to give control to the player, use:
fallback( 'human' )
'get_unit_type' function
<unit> = get_unit_type( <unit name> )
Function returns unit_type object of desired type, for example:
get_unit_type( 'Mage' )
will result in returning unit_type of a Mage.
'move' function
<action> = move( <source> , <destination> )
Moves unit from <source> to <destination> and sets unit movement to 0. For example unit formula like:
move(my_leader.loc, loc(my_leader.loc.x, my_leader.loc.y - 1) )
will make leader move one hex north. Leader's movement points will be reset to 0.
'move_partial' function
<action> = move_partial( <source> , <destination> )
Moves unit from <source> to <destination>. For example unit formula like:
move(my_leader.loc, loc(my_leader.loc.x, my_leader.loc.y - 1) )
will make leader move one hex north.
'run_file' function
<formula> = run_file( <string_file_location> )
Parses and runs the specified .fai file. 'def'-style functions in the file are added to the function table of the current AI. File location follows the usual WML convention, for example, run_file('ai/formula/test.fai') will lead to './data/ai/formula/test.fai' being loaded.
At the moment, this function is useful mainly for debugging from the game console.
'set_unit_var' function
<action> = set_unit_var( <key>, <value> , <location>)
This action creates a new variable which is attached to the unit at <location>
'set_var' function
<action> = set_var( <key> , <value> )
This action sets new variable, for example:
set_var( 'Number one' , 1 )
Will create variable with name 'Number one' and assign 1 to it.
Evaluation
'calculate_outcome' function
[<list of outcomes>] = calculate_outcome(<attacker current location>, <attacker location> , <defender location> , [<weapon>] )
returns a list of possible outcomes when unit standing at <attacker current location> attacks the unit at <defender location> from <attacker location>
if no weapon is provided, it will return for the weapon considered the best by the C++ weapon choice algorithm (the one used to select default weapon in normal games)
'chance to hit' function
<number> = chance_to_hit( <unit> , <location> )
This function returns how possible ( in % ) it is to hit given <unit> in a specific <location>. For example:
chance_to_hit( my_leader , my_leader.loc )
shows how easy it is to hit your leader has in a place he is currently standing on.
'evaluate_for_position' function
<variant> = evaluate_for_position(<position>, <formula> )
Returns the result of <formula> as if <formula> was evaluated with a position of <position> instead of the current position
'max_possible_damage' function
<number> = max_possible_damage( <attacking unit> , <defending unit> )
Function returns highest possible damage that <attacking unit> can inflict to <defending unit>.
'max_possible_damage_with_retaliation' function
<number> = max_possible_damage_with_retaliation( <attacking unit> , <defending unit> )
Function returns an array:
[ <attacker_melee>, <attacker_ranged>, <defender_melee>, <defender_ranged> ]
in which first two elements are highest possible damage that <attacking unit> can inflict to <defending unit> with melee and ranged attacks, and latter two elements are highest possible damage that <defending unit> can inflict to <attacking unit> also with melee and ranged attacks.
'movement_cost' function
<number> = movement_cost( <unit> , <location> )
This function returns movement cost of given <unit> in a specific <location>. For example:
movement_cost( my_leader , my_leader.loc )
shows what movement cost your leader has in a place he is currently standing on.
'next_hop' function
[<location>] = next_hop( src,dst, [unit_location])
this function returns the 'next hop' location to move for the unit at unit_location standing at src if it wants to move to dst. if unit_location is omitted, it defaults to src.
'outcomes' function
[<list of positions>] = outcomes( <attack> )
this function take an attack (i.e a member of the "attacks" global variable) and return an array of positions
each position has a "chance" readable member that gives the chance of this outcome of occuring
other members of the position are not readable
positions are used as parameters for the evaluate_for_position function
'timeofday_modifier' function
<number> = timeofday_modifier(<unit> [, <location>] )
This function returns combat modifier (percentage, such as 25 for lawful unit during the day) due to time of day, taking alignment, illuminate, time of day and fearless trait into account. note: 'leadership' and 'slowed' are not taken into account.
unit - unit for which to evaluate
location - location for which to evaluate (optional, defaults to unit's current location)
Gamemap functions
'adjacent_locs' function
<loc list> = adjacent_locs( <location> )
Returns a list containing the list of the six locations adjacent to <location>
'castle_locs' function
[<loc list>] = castle_locs(<location>)
given a hex, this function will return the list of all locations that is connected to <location> only by keeps or castle. I.e the hexes you can recruit from, assumin that you are at a keep at <location>
'close enemies' function
<units list> = close_enemies( <location> , <distance> )
This function gets a list of enemies in the given or smaller distance from the location. For example:
close_enemies(loc(10,10), 5)
gives back a list of enemies in the distance of 5 tiles or less from the tile (10, 10).
'distance_between' function
<number> = distance_between( <location A> , <location B> )
This function returns distance (in hexes) between <location A> and <location B>. For example:
distance_between( loc( 1, 1) , loc( 3, 3) )
will return 3.
'distance_to_nearest_unowned_village' function
<number> = distance_to_nearest_unowned_village( <location A> )
This function returns distance (in hexes) between <location A> and nearest unowned village.
'defense_on' function
<number> = defense_on( <unit> , <location> )
This function returns defense rate of given <unit> in a specific <location>. For example:
defense_on( my_leader , my_leader.loc )
shows how good defense your leader has in a place he is currently standing on.
'find_shroud' function
<locations list> = find_shroud()
This function will return a list of locations of shrouded hexes.
'is_avoided_location' function
<boolean> = is_avoided_location(map_location)
This function will return the answer to question 'is location avoided by current ai?'
'is_unowned_village' function
<boolean> = is_unowned_village( <map or ai.map> , <location> ) #1
<boolean> = is_unowned_village( <map or ai.map> , <coordinate x> , <coordinate y> ) #2
The first argument is always a 'map' - member of the ai which provides information about the gamemap.
This will return true if we don't own the village (i.e it is unowned, owned by an ennemy, or owned by al allie)
'is_village' function
<boolean> = is_village( <map or ai.map> , <location> ) #1
<boolean> = is_village( <map or ai.map> , <coordinate x> , <coordinate y> ) #2
The first argument is always a 'map' - member of the ai which provides information about the gamemap.
In #1 usage, we put in as a second argument location. In #2, second and third arguments are numbers: coordniates of the certain hex on a map. Function checks if that place is a village, and returns either 1 (yes, it is village) or 0 (no, it isn't village). Example of usage:
is_village( map , loc( 2, 3) )
is_village( map , 2, 3)
Both check, if hex with coordinates 2,3 is a village.
Remember, when using is_village in custom function, you either have to access map by writing 'ai.map', or specify ai as a 'default input'.
'loc' function
<location> = loc( <X number>, <Y number> )
Function will return a location (pair of numbers) from two given input arguments.
'shortest_path' function
<list of locations> = shortest_path( <location A> , <location B> [, <unit location> ] )
When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function takes into account zone of control of enemy units.
'simplest_path' function
<list of locations> = simplest_path( <location A> , <location B> [, <unit location> ] )
When only 2 parameters are specified, function returns list with all locations that unit standing on <location A> has to move through to get to <location B>. If optional 3rd parameter is specified, it returns list with all locations that unit standing on <unit location> would need to move through to get from <location A> to <location B>. This function does not take into account zone of control or enemy units.
'suitable_keep' function
<keep location> = suitable_keep( <input location> )
Function returns location of nearest keep to the unit which is located specified <input location>.It takes a location on which a unit is standing, and returns, in order of decreasing preference: nearest (by pathfinding) empty keep reachable by that unit within 1 turn, nearest (by pathfinding) occupied keep reachable within 1 turn, result of nearest_keep() implementation, null location.
'unit_at' function
<unit> = unit_at( <location> )
This function takes only one argument - location, and returns unit if there is one standing in that location, or null otherwise. Example of usage:
unit_at( loc( 4, 4) )
'nearest_keep' function
<keep location> = nearest_keep( <input location> )
Function returns location of nearest keep to the specified <input location>, or null if there is no keep on the map.
'nearest_loc' function
<keep location> = nearest_keep( <input location>, <list of locations> )
Function returns location that is the nearest to <input location>. For example, " nearest_loc(loc(17,7),map(my_units,self.loc)) " - returns the location of a player-owned unit which is nearest to location (17,7)
'unit_moves' function
<locations list> = unit_moves( <unit location> )
Function returns list of all possible locations which unit standing at <unit location> can reach. If unit can't move, or there is no unit standing at given location, empty list is returned.
'units_can_reach' function
<units list> = units_can_reach( <possible moves list>, <location> )
Function takes as an input list of possible moves ( ai.my_moves for units that belong to AI, or ai.enemy_moves for units that belong to the opponent ) and checks which units from that list can reach <location>.
Recruitment
'recruit' function
<action> = recruit( <unit name> [, <location> ] )
This function results in recruting a unit specifed by <unit name> at first free castle hex, or at given <location>. Function:
recruit('Footpad', loc(3,3) )
will result in recruting Footpad at castle hex with coordinates 3,3.