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

Feedback Lab 5 #9

Open
hdmeyer opened this issue Oct 16, 2017 · 1 comment
Open

Feedback Lab 5 #9

hdmeyer opened this issue Oct 16, 2017 · 1 comment

Comments

@hdmeyer
Copy link

hdmeyer commented Oct 16, 2017

Group # Exercise 1 Comments Exercise 2 Comments Exercise 3 Comments Exercise 4 Comments Exercise 5 Comments Exercise 6 Comments Exercise 7 Comments Total
4 10 Excellent ? Where is solveNS and the definitions needed for that? 8 Solution is very good. It is checking that every P'has actually more than one solution, that's why it is slow. https://www.technologyreview.com/s/426554/mathematicians-solve-minimum-sudoku-problem/ . Maybe by only checking if a randomly deleted hint creates multiple solution can be sufficient. The report is not sufficiently detailed 10 Excellent solution and very good report 9 Very good, not printing separations as NRC sudokus 6 Questions are answered, but not implementation or tests are presented 0   7.7
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
@porke
Copy link
Contributor

porke commented Oct 17, 2017

Copied from previous response from Quinten: In the bottom of assignment_2.hs there are the functions solveBasic and solveRefactored that replace solveNS.

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

2 participants