

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Professor: Molnar; Class: Intro to Artificial Intell.; Subject: Computer and Info Science; University: Clark Atlanta University; Term: Fall 2007;
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Fall 2007 Assume a robot that has the functions left, right and go:
0 a 1 2 3 4 b^ c 5 6 7 8 d^ e^ f 9 10 g^ h^ i 11 12 j 13 14 k 15 l y/x 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 The following paths between notes are defined as Prolog facts. Each path begins under the assumption that the robot is facing south. When it arrives at its destination it will face south again. IMPORTANT: the robot only knows these paths. The path predicate is defined in the file http://www.cis.cau.edu/475/prolog/robotmaze.pl path(a, b, [ go(4), right, go(7), left]). path(b, e, [left, go(7), right, go(4)]).
path(a, c, [go(1), left, go(6), right, go(3)]). path(b, d, path(d, k, path(d, g, path(c, h, path(a, f, path(f, i, path(h, i, path(i, l,