BotBrain plays a match with the commands a player sends: it picks a landing marker near the barge's route, loots points of interest (following their own walking routes into huts, lofts and piers), fights opponents it can see, bandages itself, and gets to ground the coming tide will leave dry. BotWorld is the map every bot shares: loot markers, routes, and each tide phase's safe ground, which is the dry land joined to the island's highest walkable ground. Three difficulties (Tuning.BOT_DIFFICULTIES) set reaction time, sight range and aim error. The server mixes them unless --bot-difficulty says otherwise. NavGrid labels connected regions when it is built, so a goal that is cut off is turned down without a search of the whole island (about 70 ms each). make bot-matches plays 20 bot-only matches and checks winners, drownings and difficulty. Seeds 101 to 120: 20 of 20 with a winner, 7 of 460 deaths were drownings (1.5%), easy bots placed worst (13.7 against 11.8 and 12.0) and hard bots took the most eliminations (186 against 137 and 132). Closes #28 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
215 lines
8.5 KiB
GDScript
215 lines
8.5 KiB
GDScript
extends TestCase
|
|
|
|
## Bot navigation from issue M4: bots reach random reachable places on 50 islands,
|
|
## plan again when water or new walls cross their path, and 23 of them stay inside the
|
|
## server's tick budget. Bots only ever send PlayerCommands.
|
|
|
|
const FLOOR: float = 8.0
|
|
## Building level whose base is FLOOR.
|
|
const LEVEL: int = 4
|
|
const START: Vector3 = Vector3(100.0, FLOOR, 100.0)
|
|
const GOAL: Vector3 = Vector3(100.0, FLOOR, 170.0)
|
|
|
|
|
|
func test_bots_reach_random_reachable_targets_on_50_islands() -> void:
|
|
var seeds: Array[int] = []
|
|
for seed_value: int in range(100, 150):
|
|
seeds.append(seed_value)
|
|
var result: Dictionary = NavSweep.run(seeds, 2)
|
|
var trials: int = result["trials"]
|
|
var reached: int = result["reached"]
|
|
assert_true(trials >= 95, "found reachable targets for %d trials" % trials)
|
|
var rate: float = float(reached) / maxi(trials, 1)
|
|
for failure: Dictionary in result["failures"]:
|
|
print(" nav miss: %s" % failure)
|
|
assert_true(rate >= 0.95, "reached %d of %d (%.1f%%)" % [reached, trials, rate * 100.0])
|
|
|
|
|
|
## A flat world with one player at START and a bot walking it to `goal`.
|
|
func _flat() -> Simulation:
|
|
var sim: Simulation = Simulation.new(7, SimGround.flat(FLOOR))
|
|
var player: SimEntity = sim.entities.find(sim.add_player())
|
|
player.position = START
|
|
player.on_ground = true
|
|
return sim
|
|
|
|
|
|
## Steps the bot until it stops moving or `limit` ticks pass, calling `each` (if
|
|
## given) with the tick number before every step.
|
|
func _walk(sim: Simulation, grid: NavGrid, bot: NavBot, limit: int, each: Callable = Callable()) -> void:
|
|
for index: int in limit:
|
|
if each.is_valid():
|
|
each.call(index)
|
|
grid.sync(sim)
|
|
var command: PlayerCommand = bot.think(sim, grid)
|
|
assert_true(command is PlayerCommand)
|
|
sim.submit_command(bot.player_id, command)
|
|
sim.step()
|
|
if bot.status != NavBot.MOVING:
|
|
return
|
|
|
|
|
|
func test_a_bot_walks_straight_across_open_ground() -> void:
|
|
var sim: Simulation = _flat()
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
var bot: NavBot = NavBot.new(1)
|
|
bot.set_goal(GOAL)
|
|
_walk(sim, grid, bot, 30 * 30)
|
|
assert_eq(bot.status_name(), "arrived")
|
|
assert_eq(bot.plans, 1)
|
|
var feet: Vector3 = sim.entities.find(1).position
|
|
assert_true(Vector2(feet.x - GOAL.x, feet.z - GOAL.z).length() <= bot.arrive_radius)
|
|
|
|
|
|
func test_a_new_wall_across_the_path_triggers_a_new_path_around_it() -> void:
|
|
var sim: Simulation = _flat()
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
var bot: NavBot = NavBot.new(1)
|
|
bot.set_goal(GOAL)
|
|
# Lambdas capture locals by value, so the first path goes into a shared array.
|
|
var first_path: Array[Vector2i] = []
|
|
var build_wall: Callable = func(index: int) -> void:
|
|
if index == 1:
|
|
first_path.append_array(bot.path)
|
|
if index == 20:
|
|
# A row of real wooden walls across the way, 30 m ahead: x 80 to 120 m, z 136 m.
|
|
for x: int in range(20, 30):
|
|
sim.structures.add(StructureSet.WALL, 0, Vector4i(x, LEVEL, 34, StructureSet.SLOT_WALL_Z), 0, 0, sim.tick, sim.ground)
|
|
_walk(sim, grid, bot, 60 * 30, build_wall)
|
|
assert_eq(bot.status_name(), "arrived")
|
|
assert_true(bot.plans >= 2, "planned again after the wall went up (%d plans)" % bot.plans)
|
|
var crosses: bool = false
|
|
for point: Vector2i in first_path:
|
|
if point.x * 2.0 > 80.0 and point.x * 2.0 < 120.0 and point.y * 2.0 == 136.0:
|
|
crosses = true
|
|
assert_true(crosses, "the first path went straight through where the wall is")
|
|
for point: Vector2i in bot.path:
|
|
var x: float = point.x * NavGrid.CELL
|
|
var z: float = point.y * NavGrid.CELL
|
|
assert_false(x > 79.0 and x < 121.0 and absf(z - 136.0) < 1.0, "the new path avoids the wall at %s" % point)
|
|
|
|
|
|
func test_a_broken_wall_opens_the_way_again() -> void:
|
|
var sim: Simulation = _flat()
|
|
var wall: StructureSet.Piece = sim.structures.add(StructureSet.WALL, 0, Vector4i(25, LEVEL, 34, StructureSet.SLOT_WALL_Z), 0, 0, 0, sim.ground)
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
var blocked_point: Vector2i = grid.point_of(Vector3(102.0, FLOOR, 136.0))
|
|
assert_false(grid.is_open(blocked_point), "the wall blocks the grid")
|
|
sim.structures.remove(wall.id, sim.ground)
|
|
for _index: int in 40:
|
|
sim.step()
|
|
grid.sync(sim)
|
|
assert_true(grid.is_open(blocked_point), "the scan frees points once the wall is gone")
|
|
assert_true(grid.changed_tick[grid.index_of(blocked_point)] > 0)
|
|
|
|
|
|
## Ground at 3 m with a sunken strip, x 60 to 140 m and z 124 to 136 m, whose floor is
|
|
## level with the starting sea. Its banks slope over 6 m, so it's walkable while the
|
|
## sea is low.
|
|
func _strip_ground() -> SimGround:
|
|
var side: int = roundi(Tuning.WORLD_SIZE_METRES / 2.0) + 1
|
|
var values: PackedFloat32Array = PackedFloat32Array()
|
|
values.resize(side * side)
|
|
for z: int in side:
|
|
for x: int in side:
|
|
var wx: float = x * 2.0
|
|
var wz: float = z * 2.0
|
|
var dx: float = maxf(maxf(60.0 - wx, wx - 140.0), 0.0)
|
|
var dz: float = maxf(maxf(124.0 - wz, wz - 136.0), 0.0)
|
|
var distance: float = sqrt(dx * dx + dz * dz)
|
|
values[z * side + x] = lerpf(0.0, 3.0, clampf(distance / 6.0, 0.0, 1.0))
|
|
return SimGround.from_heights(values, side, 2.0)
|
|
|
|
|
|
func test_rising_water_across_the_path_triggers_a_new_path_around_it() -> void:
|
|
var sim: Simulation = Simulation.new(7, _strip_ground())
|
|
var player: SimEntity = sim.entities.find(sim.add_player())
|
|
player.position = Vector3(100.0, 3.0, 100.0)
|
|
player.on_ground = true
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
var bot: NavBot = NavBot.new(1)
|
|
var goal: Vector3 = Vector3(100.0, 3.0, 160.0)
|
|
bot.set_goal(goal)
|
|
var swam: Array[bool] = [false]
|
|
var crossed_strip: Array[bool] = [false]
|
|
var flood: Callable = func(index: int) -> void:
|
|
if index == 1:
|
|
for point: Vector2i in bot.path:
|
|
if point.y * 2.0 > 124.0 and point.y * 2.0 < 136.0 and point.x * 2.0 > 60.0 and point.x * 2.0 < 140.0:
|
|
crossed_strip[0] = true
|
|
if index == 15:
|
|
sim.set_sea_level(2.0)
|
|
if player.swimming:
|
|
swam[0] = true
|
|
_walk(sim, grid, bot, 90 * 30, flood)
|
|
assert_true(crossed_strip[0], "the first path crossed the dry strip")
|
|
assert_eq(bot.status_name(), "arrived")
|
|
assert_true(bot.plans >= 2, "planned again when the strip flooded")
|
|
assert_false(swam[0], "walked around the water instead of swimming")
|
|
for point: Vector2i in bot.path:
|
|
assert_eq(grid.wet[grid.index_of(point)], 0, "the new path stays dry")
|
|
|
|
|
|
func test_with_no_dry_way_round_the_bot_swims() -> void:
|
|
# The same strip, but the sea rises over everything around it too: the only way is
|
|
# through water, and the bot takes it.
|
|
var sim: Simulation = Simulation.new(7, _strip_ground())
|
|
var player: SimEntity = sim.entities.find(sim.add_player())
|
|
player.position = Vector3(100.0, 3.0, 100.0)
|
|
player.on_ground = true
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
sim.set_sea_level(4.5)
|
|
grid.sync(sim)
|
|
var bot: NavBot = NavBot.new(1)
|
|
bot.set_goal(Vector3(100.0, 3.0, 130.0))
|
|
_walk(sim, grid, bot, 60 * 30)
|
|
assert_eq(bot.status_name(), "arrived")
|
|
|
|
|
|
func test_a_goal_inside_a_solid_block_is_unreachable() -> void:
|
|
var sim: Simulation = _flat()
|
|
# A closed box of solid rock around the goal.
|
|
sim.ground.add_solid(AABB(Vector3(90.0, FLOOR - 1.0, 150.0), Vector3(20.0, 10.0, 20.0)))
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
var bot: NavBot = NavBot.new(1)
|
|
bot.set_goal(Vector3(100.0, FLOOR, 160.0))
|
|
_walk(sim, grid, bot, 30)
|
|
assert_eq(bot.status_name(), "unreachable")
|
|
|
|
|
|
func test_planning_is_limited_per_tick() -> void:
|
|
var sim: Simulation = _flat()
|
|
for _index: int in 3:
|
|
var other: SimEntity = sim.entities.find(sim.add_player())
|
|
other.position = START
|
|
other.on_ground = true
|
|
var grid: NavGrid = NavGrid.build(sim)
|
|
grid.sync(sim)
|
|
var bots: Array[NavBot] = []
|
|
for id: int in [1, 2, 3, 4]:
|
|
var bot: NavBot = NavBot.new(id)
|
|
bot.set_goal(GOAL)
|
|
bots.append(bot)
|
|
bot.think(sim, grid)
|
|
var planned: int = 0
|
|
for bot: NavBot in bots:
|
|
planned += bot.plans
|
|
assert_eq(planned, Tuning.BOT_NAV_PATHS_PER_TICK, "one tick plans at most the budget")
|
|
|
|
|
|
func test_23_bots_stay_within_the_tick_budget_and_get_somewhere() -> void:
|
|
var loop: ServerLoop = ServerLoop.new(20261111, 1, 23)
|
|
var ticks: int = 75 * Tuning.TICK_RATE_HZ
|
|
for _index: int in ticks:
|
|
loop.run_tick()
|
|
var stats: Dictionary = loop.timing_stats()
|
|
print(" 23 bots, %d ticks: p50 %d us, p99 %d us, max %d us, %d over budget" % [stats["ticks"], stats["p50_us"], stats["p99_us"], stats["max_us"], stats["over_budget"]])
|
|
assert_true(stats["p99_us"] < ServerLoop.TICK_BUDGET_USEC, "p99 tick under budget")
|
|
assert_true(stats["over_budget"] <= ticks / 200, "at most 0.5% of ticks over budget (a busy shared host)")
|
|
var walking: int = 0
|
|
for bot: BotBrain in loop.bots:
|
|
if bot.nav.plans > 0:
|
|
walking += 1
|
|
assert_true(walking >= 20, "%d of 23 bots planned paths after landing" % walking)
|
|
assert_eq(loop.bots.size(), 23)
|