Differences

This shows you the differences between two versions of the page.

--- public:t-622-arti-09-1:program_1 [2009/01/26 13:48] – created hannes
+++ public:t-622-arti-09-1:program_1 [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 1: / Line 1: @@
-====== Programming Project 1: Blind Search ======
+====== Programming Assignment 1: Blind Search in LISP ======
-**Weight:** 5%
+**Weight:** 5%\\
-**Due:** Monday, February 9th, by 23:59
+**Due:** Monday, February 9th, by 23:59\\
-**Group Size:** 1-2
+**Group Size:** 1-2\\
-**Programming Language:** LISP
+**Programming Language:** LISP\\
 ===== Introduction =====
-LISP is the second oldest high-level programming language and was the leading language in AI research from its infancy. It has greatly influenced other languages and computer science in general, for example by pioneering the [[http://ana.lcs.mit.edu/~jnc//humour/lisp.tree|tree data structure]]. It is therefore only appropriate that it is the language of choice for a "Blind Search" programming project - It is a basic AI problem solving technique that relies on the generation of a tree structure.
+LISP is the second oldest high-level programming language and was the leading language in AI research from its infancy. It has greatly influenced other languages and computer science in general, for example by pioneering the [[http://ana.lcs.mit.edu/~jnc//humour/lisp.tree|tree data structure]]. It is therefore only appropriate that it is the language of choice for a "Blind Search" programming assignment - It is a basic AI problem solving technique that relies on the generation of a tree structure.
-Consider this project as an opportunity to both write your own LISP code and to experiment with basic search strategies that underlie many important problem solving techniques.
+Consider this assignment as an opportunity to both write your own LISP code and to experiment with basic search strategies that underlie many important problem solving techniques.
 ===== Description =====
@@ Line 21: / Line 21: @@
 The project consists of the following steps:
+  - Use the file {{:public:t-622-arti-09-1:search.lisp.zip|search.lisp}} as a starting point. It contains some useful structures and functions.
   - Formulate the problem as a basic search problem (initial state, goal test, successor function) - write this information clearly as comments at the beginning of your file.
   - Implement a breadth-first (BF), depth-first (DF) and iterative-deepening DF (ID) search strategies. Try to re-use your search mechanism as much as possible (i.e. see if you can plug the search strategy into a general mechanism).