CPSC 201: Introduction to Computer Science
Instructor: Carsten Schürmann
Department of Computer Science
Time: MWF 11:30-12:20
The tournament is over. Congratulations to Andrew who beat Semih in an incredibly exciting final match. Also congratuations to all other players who participated. Your implementations were fantastic.
The tournament was played in the following way. Each match consisted of two games, with each of the contestants opening the game with white. If somebody won boths games, he would progress to the next round, in the case of tie, we would take the total score into account. We started with the quarter finals, and by elimination find the winner.
The eight compilable and runnable contestants were Andrew, Matt, Semih, Fitzy, Daniel, Lea, Patrick, and Vishal.
Semi FinalsFour contestants made it into the semi finals. Fitzy, Matt, Semih, and Andrew. Here are the results.
FinalThe final was scheduled for this afternoon, and what a final it was. Andrew and Semih were both well prepared and ready to play their best. Andrew's strategy was always to go for points, Semih seemed to prefer to prevent his opponent from building to large, and too high. At 12:37, Andrew is making the opening move, builds immediately for height and surface, when Semih tried to get a piece of the cake. Semih's strategy worked, and he could claim a 8 point lead over Andrew (44:52) (Match 1). But Semih is much better in defense than offense, as the second match showed. Semih manovered himself into a losing situtation early on in the game, by giving Andrew the opportunity to raise a private, protected, unreachable, ever-growing tower in the lower right corner of the board. Actually, Andrew managed to build up and place to knights on two towers of height 8, while Semih could not prevent him reaching his goal. Andrew won Match 2 with a stunning 148:59 over Semih. Quite impressive.
Finals are graded. Send me email if you are interested how you did.
Final location: Becton CO31.
Review sessions. Monday, 7pm, AKW200 (with Andrew). Tuesday, 10am, Au bon pain (with Robert).
The new release of Torres is 1.06. It now knows how to compare scores.
The new release of Torres is 1.05. It now detects inital faulty moves. To install this latest version:
New version Torres (1.03) available. Please download.
Here's how you do it. Copy the files into your working directory
The Torres source code is updated, and ready for the tournament. Please copy from the course directory.
Code from class today is online : 33.sml.
Assignment 8 is online.
Solution to Assingment 7 is online.
Here's the a pointer to the paper I referred to in class Robert Harper: Functional pearls. Proof directed debugging.
Assignment 7 is online.
Code from class today is online : regexp.sml.
Assignment 6 is online.
The code for our Turing machine language simulator is now online.
Addition to homework 5:
The code for our machine language simulator is now online.
Robert Lee will hold a review session Wednesday 4-6pm at Au Bon Pain.
Assignment 5 is online. It's due Wednesay after the midterm. Try to solve it before!
Class takes place today Monday 2/17/2003.
Assignment 4 is online.
Andrew's office hours have moved to Monday 5:00pm.
Notes on induction by Michael Erdmann can be found here.
Assignment 3 is online.
I have updated assignment 2.
Classes meet in AKW 200 from today on.
Code of the first recitation
Recitation schedule: Thursday 2:30 AKW500 (with Robert Lee), Thursday 5:00 AKW 500 (with Andrew McCreight).
Typo in Question 2: Use a function
Hand-in instructions for homework:
In the course directory
submits your file
For questions, discussions, ..., please use the newsgroup
The bookstore told me that Elements of ML is going to be in store either tomorrow or Thursday.
TextbooksThe following textbooks are required:
The course requirements consist of (more-or-less) weekly programming assignments in ML and occasional written homework, a midterm, and a final examination, which takes place some day after reading week. Plan on spending between 6-8 hours per week on the course outside of class. The programming assignments are an integral part of the course.
Please don't leave the homework to the last minute. You will be more efficient, learn more, have more chance to get help, and generally be calmer and happier if you do the associated reading first and start the programming or other problems early. Note that overcrowding in the Zoo, broken printers, etc. are not unheard of the night before an assignment is due, and will not be accepted as excuses for late homework.
Recitations are an important supplement to this class. A TA will discuss problems related to class.
Hand-in instructionsIn the course directory
submits your file
The final grade in the course will be based on your performance on the programming assignments and other homeworks (50%), the midterm and the final examination (50%).
Late work without a Dean's excuse will be assessed a penalty of 10 points per day, based on the day and time recorded by the electronic submit program. If you have a Dean's excuse, making up missed work may involve alternative assignments, at the discretion of the instructor; please check with the instructor in this case.
Policy on Working Together
Unless otherwise specified, the homework assignments are your individual responsibility. Plagiarism is a violation of University rules and will not be tolerated. You must neither copy work from others nor allow your own work to be copied.
You are encouraged to ask others for help with the computers and Unix, with questions about ML, general questions about the concepts and material of the course, or with casual questions about your program, but if you need more extensive help with a program or other assignment, please ask a TA or the instructor for assistance. Working in groups to solve homework problems is not permitted in this course. Please talk to the instructor if you have any questions about this policy.