Author:
Pathak Neeraj,Kumar Rajeev
Publisher
Springer Science and Business Media LLC
Reference37 articles.
1. Crawford, B., Castro C., Monfroy, E.: Solving Sudoku with constraint programming. In: Proceedings of International Conference on Multiple Criteria Decision Making (MCDM), Communications in Computer and Information Science, pp. 345–348. Springer (2009). https://doi.org/10.1007/978-3-642-02298-2_52
2. Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(5), 1052–1060 (2003)
3. Pelánek R.: Difficulty rating of Sudoku puzzles by a computational model. In: Proceedings of 24th International on FLAIRS Conference (2011)
4. Coello, C.A.C.: Treating constraints as objectives for single-objective evolutionary optimization. Eng. Optim. 32(3), 275–308 (2000). https://doi.org/10.1080/03052150008941301
5. Kramer, O.: A review of constraint-handling techniques for evolution strategies. Appl. Comput. Intell. Soft Comput. 2010(3), 11 (2010). https://doi.org/10.1155/2010/185063