 |
|
 |
| Question 5 |
 |
| ODL 129 TEAM B Coursework 1 |
 |
| Answer |
| Give a concrete example of a search (using digraphs or tree diagrams, where necessary) that tsets the following database for adjacent blocks that are to be considered adjacent (according to your definition). |
| Name |
| Type |
| Colour |
| Position (block center) |
| X , Y extent |
| A B C D E F G H I J |
| Rectangle Rectangle Rectangle Recatngle Rectangle Rectangle Circle Circle Triangle Triangle |
| ( 4 , 7 ) ( 5, 8 ) ( 7 , 7 ) (15 , 15 ) ( 15 , 5 ) ( 15 , 13 ) ( 9 , 11 ) ( 7 , 5 ) ( 3 , 9 ) ( 17 , 3 ) |
| ( 4 , 2 ) ( 2 , 4 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) ( 2 , 2 ) |
| Blocks world database |