Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
matsemann
on May 28, 2013
|
parent
|
context
|
favorite
| on:
A CP Solution for XKCD NP Complete Restaurant Orde...
As a person not heavily invested in Prolog, can you explain how that works? Is it just branching by
choice
s from the different groups and it backtracks/fails back up to the last choice if constraints are not met?
kaoD
on May 28, 2013
[–]
Pretty much that, yeah.
http://en.wikipedia.org/wiki/Unification_%28computer_science...
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: