๐Ÿ”Ž Search

Csp

Published on
์ธ๊ณต์ง€๋Šฅ๊ฐœ๋ก  | Constraint Satisfaction Problem

์ธ๊ณต์ง€๋Šฅ๊ฐœ๋ก  | Constraint Satisfaction Problem

๊ธฐ์กด์—๋Š” ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๋Š”๋ฐ ์žˆ์–ด์„œ ์ƒํƒœ๊ฐ€ ์•Œ ์ˆ˜ ์—†์—ˆ๋˜ ์ƒํƒœ(black box)์˜€๋‹ค๋ฉด, ์•ž์œผ๋กœ ํ•ด๊ฒฐํ•  ๋ฌธ์ œ๋“ค์€ ๊ณต์—ญ(domain) D ๋‚ด์—์„œ ์ƒํƒœ๊ฐ€ ์ •์˜ ๋œ๋‹ค. ์ด ๋•Œ ๋ชฉํ‘œ์— ๋Œ€ํ•œ ๋น„์šฉ์€ ๋ฌธ์ œ ์˜์—ญ์œผ๋กœ ํ•œ์ •๋œ(domain-specific) heuristic function์œผ๋กœ ํ‰๊ฐ€๊ฐ€ ๋˜๋ฉฐ ๋ชจ๋“  ๋ณ€์ˆ˜์˜ ๊ฐ’์ด ํ•ด๋‹น ๋ณ€์ˆ˜์— ๊ฐ€ํ•ด์ง„ ๋ชจ๋“  constraint๋ฅผ ์ถฉ์กฑํ•˜๋ฉด ๋ฌธ์ œ..