Code

Create a Navmesh by playing the game.

Starting with a list of roms and save states, spawn a worker for each pair and merge the resulting navmeshes.

Generate a batch of jobs to run for every unvisited node in the navmesh.

Navmesh(a::Navmesh, b::Navmesh)::Navmesh

Merge two Navmeshes - a and b - into a new Navmesh.

Navmesh()::Navmesh

Create a new Navmesh.

Navmesh!(a0::Navmesh, a::Navmesh)::Nothing

Merge a into a0 in place. See Navmesh(a::Navmesh, b::Navmesh)::Navmesh for more details.

Navmesh!(n::Navmesh, from::Position, to::Position, d::Direction)::Nothing

Add an edge in n between from and to labeled as direction d.

from and to do not need to exist.

This will overwrite any previous edge between these two nodes.

Navmesh!(n::Navmesh, j::Journey)::Nothing

Add all locations found on Journey j.

Filters out artifacts from animation delays.

asbutton(d::Direction)::Button

Convert directions to buttons.

Examples

asbutton(Up)

# output

ButtonUp::Button = 64

asdirection(b::Button)::Direction

Convert buttons to directions.

Examples

asdirection(ButtonUp)

# output

Up::Direction = 0

connected(n::Navmesh, from::Position, to::Position)::Bool

Predicate to check if two nodes are connected.

Examples

n = Navmesh()
p1 = Position(0x01, 0x01, 0x01)
p2 = Position(0x01, 0x01, 0x02)
p3 = Position(0x01, 0x02, 0x02)
Navmesh!(n, p1, p2, Down)
Navmesh!(n, p2, p3, Right)

connected(n, p1, p3)

# output

true

load_latest_artifact()::Navmesh

Load the most recently published navmesh into memory.

randomincomplete(n::Navmesh, nogolist::Vector{Position})::Union{Position, Nothing}

Select a random, incomplete vertex in the navmesh. Incomplete vertices have less than four outedges - e.g. Up, Down, Left, Right.

route(n::Navmesh, from::Position, to::Position)::Vector{Direction}

Find a route between from and to in the provided Navmesh, n.

If no route exists an empty Vector will be returned instead.

Examples

n = Navmesh()

p1 = Position(0x01, 0x01, 0x01)
p2 = Position(0x01, 0x01, 0x02)
p3 = Position(0x01, 0x02, 0x02)
Navmesh!(n, p1, p2, Down)
Navmesh!(n, p2, p3, Right)

route(n, p1, p3)

# output

2-element Vector{Direction}:
 Down::Direction = 2
 Right::Direction = 1

Emulators by location.

This way future jobs can pick up where a previous job left off.

The work to be done.

What was found by running a Job.

A collection of JobResult using the desired merge behavior for each property separately.

States of the cartography agent state machine.

bootstrapemu(emu::Emulator)::Emulator

Start from first boot of the emulator and get through the opening sequence.

dialog_skip!(js::JobState, gb::Emulator, game::GameState, i::Int)::State

Press B until the dialog goes away.

dojob(job::Job)::JobResult

Execute a job. Start from the provided state. Explore the world. Return what you find.

fiddlewithmemory!(emu::Emulator)

Set a bunch of flags in the emulator's memory to enable debug mode.

go_to_target!(js::JobState, gb::Emulator, game::GameState, i::Int)::State

Navigate to the target location then switch to wandering.

new_game!(js::JobState, gb::Emulator, game::GameState, i::Int)::State

Select the new game menu option (well "DEBUG" in the BLUEMONS.gb rom).

open_fight_debug!(js::JobState, gb::Emulator, game::GameState, i::Int)::State

Open the FIGHT/DEBUG menu from the title page of BLUEMONS.gb.

random_wander!(js::JobState, gb::Emulator, game::GameState, i::Int)::State

Wander around, biased towards the same direction you are facing. Never backwards.

releasebuttons!(emu::Emulator)

Release all of the buttons.