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

Knight's Tour Problem #461

Open
PabloBartolomeMolina opened this issue Apr 13, 2024 · 3 comments · May be fixed by #463
Open

Knight's Tour Problem #461

PabloBartolomeMolina opened this issue Apr 13, 2024 · 3 comments · May be fixed by #463
Labels
Inactive

Comments

@PabloBartolomeMolina
Copy link

Algorithm for Knight's Tour problem in Cpp.
Implementation in code.

Time Complexity : O(8^(n^2))
Space Complexity : O(n^2)
@jsjeon-um
Copy link

Can I work on this?

@PabloBartolomeMolina
Copy link
Author

Hello, I just pushed a basic code and test. Once accepted, do not hesitate to add extra tests and improve the algorithm implemented

@PabloBartolomeMolina PabloBartolomeMolina linked a pull request Apr 25, 2024 that will close this issue
Open
3 tasks
@stale Stale
Copy link

stale bot commented Feb 25, 2025

This issue has been automatically marked as inactive because it has not had recent activity. It will be closed in 15 days if no further activity occurs. Thank you for your contributions.

@stale stale bot added the Inactive label Feb 25, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Inactive
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Knigth-tour algorithm PabloBartolomeMolina/ProAlgos-Cpp
2 participants
@PabloBartolomeMolina @jsjeon-um