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.

Sign up for GitHub

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

Jump to bottom

Implement brute-force solver #3

Open
Realiserad opened this issue Mar 4, 2015 · 0 comments
Open

Implement brute-force solver #3

Realiserad opened this issue Mar 4, 2015 · 0 comments
Labels
todo

Comments

@Realiserad
Copy link
Owner

Implement a brute-force solver which returns an optimal solution to the Monk problem for a given graph G.

An optimal solution is a solution which utilises the minimum amount of pursuers P needed, and contains the shortest solution vectors possible, such that P pursuers sweep the graph G.
@Realiserad Realiserad added the todo label Mar 4, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
todo
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Realiserad