Talk:Constraint satisfaction problem
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
| ||||||||||||||||||||||||||||||||||
Support keeping separate articles + cleanup and expansion
After giving this some thought, I support keeping the articles separate.
But the cleanup and hopefull expansion could include expansion of the constraint satisfaction problem page, and simplification of the constraint satisfaction article's explanation of formal algorithms. That other page is written in a way that is most accessible to the general reader not familiar with technical detail on either the subject or methods similar to those use in CSP programming and should remain generally accessible without going into great detail of solutions of CSP problems -- precisely where references to the constraint satisfaction problem or other more techical pages should be made.
Then the constraint satisfaction problem page should expand on algorithms and methods based on tree search and other methods, with links to individual algorithms by name.
My time is limited at this point, but in the next year I will see what I can do. Especially the constraint satisfaction problem page should be expanded to include more algorithms and history. I repeated part of this note from edited form on constraint satisfaction page.