games/raycaster
1
0
Fork 0
Code Issues 30 Pull requests Projects Releases 2 Packages Wiki Activity Actions

In the GOAP algorithm is there really no way to have cost #22

New issue
Open
opened 2025-06-26 16:53:28 +00:00 by zedshaw · 0 comments
zedshaw commented 2025-06-26 16:53:28 +00:00 (Migrated from lcthw.dev)
Copy link

In goap.cpp I talk about how the cost factor of the A* algorithm doesn't actually work because of the boolean sselectors.

In goap.cpp I talk about how the cost factor of the A* algorithm doesn't actually work because of the boolean sselectors.
Sign in to join this conversation.
No Branch/Tag specified
Branches Tags
master
version-0.2
version-0.1
Labels
Clear labels
No items
No labels
Milestone
Clear milestone
No items
No milestone
Projects
Clear projects
No items
No project
Assignees
Clear assignees
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference: games/raycaster#22
No description provided.
Delete branch "%!s()"

Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?