(CSP – Constraint Satisfaction Problems) Jiˇr´ı
(CSP – Constraint Satisfaction Problems) Jiˇr´ı
(CSP – Constraint Satisfaction Problems) Jiˇr´ı
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
pPˇríklad: Barvení grafu<br />
:: Barvení grafu<br />
proměnné: W A, NT, SA, Q, NSW, V, T ,<br />
domény: Di = {red, green, blue},<br />
c○Russel, Norvig: Artificial Intelligence: A Modern Approach.<br />
omezení: Sousední oblasti musí b´yt jiné barvy.<br />
Definice v´yčtem: pro WA<strong>–</strong>NT {(red, green), (red, blue), (green, red), (green, blue),<br />
(blue, red), (blue, green)}<br />
Definice podmínkou: {W A = NT }<br />
Problémy s omezujícími podmínkami