典型的教育约束处理实例
我正在写一门课程，描述人工智能的几个主题。目前我正在研究“约束处理”部分。为了说明约束处理，我想举一个简单的例子。这个例子应该具有以下品质：
- 我想画一个 OR 树，所以这个例子不能有那么多的变量和选项
- 说明节点一致性、回溯、回跳、回标、弱松弛和弧一致性。 （这些例子应该说明这些方法是有意义的，并为约束处理增加一些价值）。
- 易于理解和表示。 （不是两页长的约束数组）。
我浏览网页已经有一段时间了，但到目前为止所有的例子都不符合这些品质。 （我也尝试简化现有问题）。
有没有典型的例子来说明这些方法/技术？给出两个不同的示例并在这两个示例之间分配技术也不会成为问题。
I'm writing a course describing several topics of Artificial Intelligence. Currently I'm working on the "Constraint Processing" part. To illustrate constraint processing I would like to include a simple example. This examples should have the following qualities:
- I want to draw an OR-tree so the example can't have that much variables and options
- Illustrating node consistency, backtracking, backjumping, backmarking, weak relaxation and arc consistency. (The examples should illustrate that these methods make sense and add some value to constraint processing).
- Easy to understand and represent. (Not a two page long array of constraints).
I have browsed the web for some time, but all examples by now don't meet these qualities. (I've also tried to simplify existing problems).
Are there any typical exampes to illustrate these methods/techniques? Giving two different examples and distribute the techniques between these two examples wouldn't be a problem too.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
旅行锦标赛问题可能符合您的一些要求。这是 NP 难题，没有太多变量和选项：
官方页面< /p>
问题陈述
The Traveling Tournament Problem might fit some of your requirements. It's NP hard and doesn't have much variables and options:
Official page
Problem statement