Ai:Artificial Intelligence is a study of human intelligence and realizing it on computers.
This class will be focused on "searching" which is one of the main topics in AI with making programs in symbol processing language Lisp.
This class will be focused on "searching" which is one of the main topics in AI with making programs in symbol processing language Lisp.
Students will learn basics of AI, and acquire skills of programming mainly on searching in Lisp.
- Acquiring basic knowledge on AI, and understanding its background.
- Making programs based on acquired knowledge.
- Acquiring the way to learn further topics in AI.
| Class schedule | HW assignments (Including preparation and review of the class.) | Amount of Time Required | |
|---|---|---|---|
| 1. | Overview of the class What is AI History of AI Aims of AI |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 2. | On "searching" What is "searching" Representation of problems State transition and search tree |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 3. | Basic search strategy 1 Depth-first search Examples of depth-first search |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 4. | Basic search strategy 2 Breadth-first search Examples of breadth-first search |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 5. | Basic search strategy 3 State transition and finite automaton Search Strategies |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 6. | Trial and error by evaluation 1 Evaluation of states and search passes |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 7. | Trial and error by evaluation 2 Evaluation of costs Hill climbing method |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 8. | Mid-team exam | Reviewing exam. | 45minutes |
| 9. | Trial and error by evaluation 3 Best-path search 1 Combinatorial explosion |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 10. | Trial and error by evaluation 4 Best-path search 2 |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 11. | Trial and error by evaluation 5 And-Or tree and searching in games 1 |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 12. | Trial and error by evaluation 6 And-Or tree and searching in games 2 |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 13. | Knowledge representation and processing Knowledge representation by Logic Reasoning by resolution Negation and closed world assumption |
Reviewing contents of the class, finishing quiz and complete programs. | 30minutes |
| 14. | Final exam | Reviewing final exam | 45minutes |
| Total. | - | - | 450minutes |
| Quiz | Mid-term exam | Final exam | Total. | |
|---|---|---|---|---|
| 1. | 10% | 10% | 20% | 40% |
| 2. | 5% | 5% | 5% | 15% |
| 3. | 5% | 5% | 5% | 15% |
| 4. | 5% | 5% | 5% | 15% |
| 5. | 5% | 5% | 5% | 15% |
| Total. | 30% | 30% | 40% | - |
Weighted average of Quiz, Mid-term exam, and Final exam.
Students who can understand problems in Quiz will be 70%
Students who can understand problems in Quiz will be 70%
Taking classes of "Discrete Mathematics", and "Data structure and Algorithms" will be strongly recommended.
- Course that cultivates an ability for utilizing knowledge
| Work experience | Work experience and relevance to the course content if applicatable |
|---|---|
| N/A | N/A |
Last modified : Thu Mar 21 14:52:35 JST 2019