The last couple weeks have been spent mostly implementing the FC-CBJ algorithm. We are testing this algorithm using both static and dynamic orderings and finding one and all solutions. This algorithm has been particularly challenging to implement since it seems to have a few more methods to implement. Also, one of the most difficult parts about this assignment has been the dynamic ordering portion. Once again, I learned the importance of good design! I originally programmed using a static list of variables and simply ordered the list at the beginning then used the same ordering to solve the problem originally (I obviously was not thinking about having to eventually do dynamic ordering!). It would have been a better idea to have two separate structures: one for the uninstantiated variables and one for the instantiated variables. Static ordering for finding one solution was challenging, but I did not run into many debugging issues until I got to the portion of finding all solutions using dynamic ordering. I found that my program found one complete solution, then found several partial solutions. Again, this issue came back to the way I had originally designed my program to find all solution by simply using the static variable list. Overall, this has been the most beneficial task so far! I’m excited to continue learning about CSP’s and plan on designing my programs a little more carefully in the future.
-Mary
No comments:
Post a Comment