Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Occupation-Based Algos #11

Closed
MaxDemmler opened this issue Oct 14, 2020 · 0 comments
Closed

Occupation-Based Algos #11

MaxDemmler opened this issue Oct 14, 2020 · 0 comments

Comments

@MaxDemmler
Copy link
Collaborator

Basic Idea:

Evaluate a position by assigning an occupier to each cell. An occupier is a player that can reach the cell fastest out of all players. A cell can be occupied by multiple players, meaning they could reach the cell within the same amount of steps.
The resulting occupation map would show regions that a player "occupies". This could be used for 1) state evaluation (e.g. a larger occupied region is preferable) and 2) decision making based on the occupation map (e.g. choose actions along occupation borders to preserve occupied regions).

I made this up but I guess there is already smth like that out there.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant