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

Backtracking algorithm (N-Queen Problem) [Go] #535

Closed
7 tasks done
vatz88 opened this issue Oct 14, 2017 · 1 comment · Fixed by #536
Closed
7 tasks done

Backtracking algorithm (N-Queen Problem) [Go] #535

vatz88 opened this issue Oct 14, 2017 · 1 comment · Fixed by #536

Comments

@vatz88
Copy link
Contributor

vatz88 commented Oct 14, 2017

This issue is about Backtracking algorithm (N-Queen Problem).

  • Issue Title is in form Algo/DS Name [Language].
  • I searched or browsed the repo’s other issues to ensure this is not a duplicate.
  • This Algo/DS is worth adding to this repository.
  • Assign this issue to me (I want to work on this).
    • I ensure that I am not already assigned to 2 or more issues.
  • I will send my PR only after I'm assigned to this issue by any maintainer.
  • I understand that I will be unassigned from this issue if I fail to send a PR for this within a week.
@singhpratyush
Copy link
Member

The contributors most likely able to help are:

@singhpratyush

Possible duplicate or related issues are:

singhpratyush pushed a commit that referenced this issue Oct 17, 2017
* n queen solution in golang added

* set n value by default

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

Successfully merging a pull request may close this issue.

3 participants