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

Finish Knight's Tour example #188

Closed
2 tasks done
SSoelvsten opened this issue Dec 12, 2021 · 0 comments · Fixed by #247
Closed
2 tasks done

Finish Knight's Tour example #188

SSoelvsten opened this issue Dec 12, 2021 · 0 comments · Fixed by #247
Assignees
Labels
📁 docs 📁 example (Proof by) Examples 📁 zdd Zero-suppressed Decision Diagrams

Comments

@SSoelvsten
Copy link
Owner

SSoelvsten commented Dec 12, 2021

With #128 we add a simple version of the Knight's Tour problem based on Bryant's N4 encoding. We are still missing the following

  • Adding explanatory comments in the .cpp file.
  • Add the example to the Examples in the documentation
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
📁 docs 📁 example (Proof by) Examples 📁 zdd Zero-suppressed Decision Diagrams
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant