Everyone except Hodges implemented the Gap-Graph algorithm for SAT p 175 in the book. This works great for Difference constraints, but not for Addition constraints. However everyone who turned that in did it right.

Hodges has some problems and I'd like to talk to him(I think its a him) about it. I gave him an 18because it appears like he tried to do the right algorithm. If he can show me where I need to change my tests to suit his solution I'll give him a 20. Yue went above and beyond with his interface. It looks really nice! Even though he only implemented difference constraints I gave him an 18.5 (90%). Everyone else got 18. If you want to bump them down by 1 than please bump Yue down .5 points.

Of course for those that didn't turn it in... 0.

Hodges

Apparently you implemented <= instead of >=. This should not be a problem, however the satisfiable tests fail. It appears that you implemented the correct procedure (SAT for Addition constraints not just difference constraints) and other than the above it look good. I would like to see you about a possible better grade. If you can show me that you can modify my tests to pass, I'll give you a 20/20.

3/6*

Recommend: 18

Augustyn

You only implemented difference constraints.

4/6

Recommend: 18

Yue

You only implemented difference constraints. But a very nice program interface!

4/6

Recommend: 18.5

Sadofsky

You only implemented difference constraints.

4/6

Recommend: 18

Neo

You only implemented difference constraints.

4/6

Recommend: 18

Miao

You only implemented difference constraints.

4/6

Recommend: 18

Ramsey

You only implemented difference constraints.

4/6

Recommend: 18

Cse913ProjS107 (last edited 2007-04-09 22:32:46 by yakko)