![]() ![]() I had to program a timetabling system where each event had a specific set of requirements, and your article and video about solving sudokus and the n-queens helped me grasp the problem. I've truly enjoyed all the Prolog videos on your channel. However, the links above will always point to the latest version. These videos are all work in progress, and they may be replaced by better versions at any time. If you are interested in constraint solving, a few related videos may also be useful: ![]() I have uploaded a short video that shows how it works for Sudoku puzzles: In this example, I am using CLP(FD/ℤ), constraint logic programming over finite domains/integers, the amalgamation of constraint programming (CP) and logic programming (LP), which blend especially seamlessly. Fast and efficient constraint propagation is often an important reason for buying a commercial Prolog system. The key feature that makes Prolog so efficient and frequently used for such tasks is constraint propagation, provided via libraries or as a built-in feature in many Prolog system. Prolog is extremely well-suited for solving combinatorial tasks like Sudoku puzzles, and also for tough practical challenges such such as timetabling, scheduling and allocation tasks on an industrial scale. Thank you very much for the publicity, I greatly appreciate your interest!
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |