misc/dungeoncrawl
1
0
Code Issues 10 Projects Packages Wiki Activity Actions

light speed #10

New issue
Open
opened 2025-01-18 13:33:02 +00:00 by unusualevent · 2 comments
unusualevent commented 2025-01-18 13:33:02 +00:00
Owner
Copy link

Could also introduce a kind of "light speed" that shows items ~4 squares away as they were one turn ago?

For example a piece that had just moved into the line of sight last turn at 4 spaces might not be visible? And a piece 8 away that moved two turns ago would just barely be visible?

Would need to store a map of past state in the naive approach a few steps back? Depending on which way they're facing?

Or reduce the compute space by checking only from angles a player is looking? Hmmm

Could also introduce a kind of "light speed" that shows items ~4 squares away as they were one turn ago? For example a piece that had just moved into the line of sight last turn at 4 spaces might not be visible? And a piece 8 away that moved two turns ago would just barely be visible? Would need to store a map of past state in the naive approach a few steps back? Depending on which way they're facing? Or reduce the compute space by checking only from angles a player is looking? Hmmm
unusualevent commented 2025-01-18 13:38:59 +00:00
Author
Owner
Copy link

Possibly keep track of X previous moves (where X is the width of the map / 4, and rewind any environmental change, as if it's a game of Snake?

Might be able to optimize if the player is halfway across the map to only keep half those moves, if they're on one side of the map you would need the full length.

Possibly keep track of X previous moves (where X is the width of the map / 4, and rewind any environmental change, as if it's a game of Snake? Might be able to optimize if the player is halfway across the map to only keep half those moves, if they're on one side of the map you would need the full length.
unusualevent commented 2025-01-18 13:40:15 +00:00
Author
Owner
Copy link

Strictly speaking is the move calculation based on the furthest player closest to the edge with the longest calculation? Or can you compute how much light rays to keep around separate for each player?

Strictly speaking is the move calculation based on the furthest player closest to the edge with the longest calculation? Or can you compute how much light rays to keep around separate for each player?
Sign in to join this conversation.
No Branch/Tag specified
Branches Tags
No results found.
No results found.
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: misc/dungeoncrawl#10
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?