Gave up on trying to get the GOAP algorithm to correctly apply the cost structure to competing choices, and instead I take the resulting action list and simply find the next best one based on cost.
This commit is contained in:
parent
52f45e1d45
commit
c014e65c13
11 changed files with 43 additions and 30 deletions
|
@ -27,10 +27,10 @@ TEST_CASE("RitualEngine basic tests", "[rituals]") {
|
|||
|
||||
fmt::println("\n\n------------ TEST WILL DO MAGICK TOO");
|
||||
ritual.dump();
|
||||
REQUIRE(ritual.will_do("magick_type"));
|
||||
REQUIRE(ritual.will_do("pierce_type"));
|
||||
|
||||
ritual.pop();
|
||||
REQUIRE(ritual.will_do("pierce_type"));
|
||||
REQUIRE(ritual.will_do("magick_type"));
|
||||
|
||||
re.reset(ritual);
|
||||
re.set_state(ritual, "has_magick", true);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue