|
Tri-College DSpace Repository >
HAVERFORD COLLEGE >
Student Scholarship >
Senior Theses >
Computer Science >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10066/1484
|
| Title: | Heuristic Counterpoint |
| Author(s): | Ambrogi, Timothy |
| Advisor(s): | Dougherty, John P. |
| Department: | Haverford College. Dept. of Computer Science |
| Abstract: | This paper will introduce and formalize the problem of generating 16th-century Fuxian counterpoint using search algorithms. Several algorithms will be analyzed with respect to the problem domain, and the advantages of heuristics will be considered for each algorithm. The paper culminates with an in-detail description of the algorithms in question, and how they might be implemented. |
| URI: | http://hdl.handle.net/10066/1484 |
| Appears in Collections: | Computer Science
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 2004AmbrogiT.pdf | Thesis | 269Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
