Wednesday, April 30, 2008

Professor Sleator's office hours

I'll be having office hours Thursdsay and Friday from 3pm to 5pm both days. My office is Wean 4128.

Tuesday, April 29, 2008

Chess Bot Results Page

You can determine your last 10 wins/losses/ties against BachChoy and JackBach by visiting http://boojum.link.cs.cmu.edu/211/chess-results.html. Also, as discussed in the assignment documentation, we will be resetting the 211 pool ratings at 5pm today, Wednesday, April 30. If you wish to compete in the pool for extra credit, you will need to play at least 20 games in the pool by Friday, May 2 at 11:59pm. See the assignment documentation for how these metrics factors into your grade for this assignment.

Monday, April 28, 2008

Office hour moved

I'll have my office hour tomorrow (4/29) from 6:30-7:30 (30 mins earlier than usual) at WeH 7th floor couches. Sorry for any confusion this might cause.

Saturday, April 26, 2008

Errors in Non-Essential ArrayBoard Functions

A student recently found a bug in ArrayBoard.countOfColor() and ArrayBoard.countOfType(). If you do not use either function, then you don't have to change anything. If you do use either function (they are probably throwing exceptions), see the topic on the discussion board with the fix. I apologize for any problems this may have caused.

Friday, April 25, 2008

Office Hour Move 4/25

I have 3 project/poster/design review due within the next day so I'll be moving my office hour to Saturday (4/26) at 6:00pm-7:00pm in Morewood Clusters.

Thursday, April 24, 2008

Lecture 26: Randomized Algorithms

Primality testing, Treaps, n-queens, counting-solutions (TXT,PDF)

Lecture 25: More Chess Programming

Zobrist keys, killer moves, etc. (TXT)

Tuesday, April 22, 2008

NO RECITATION TOMORROW (ALL SECTIONS)

To give you more time to work on chess, there will be no recitation this week (April 23rd), regardless of the sections. The week after will be a optional make-up quiz (April 30th), so don't forget to come to the recitation next week if you want to take the quiz. You will also be given an opportunity to complete TA evaluations on the 30th. And good luck on your chess assignment!

Cancelled Office Hours

Unfortunately, I need to cancel my office hours for today (4/22) due to a not so sudden illness. I apologize for any inconvience that this creates.

Monday, April 21, 2008

Offline TextChess Fixes

There were a few bugs with the interaction between the provided ArrayBoard class and the offline TextChess class. If you have already downloaded the stubs and want to use the TextChess class, please see the discussion board for the specifics of what was changed. If you have not yet downloaded the stubs or you only care about playing on the chess server (online), then you don't have to do anything. Sorry for the inconvenience. Direct questions about these fixes to Owen.

Wednesday, April 16, 2008

Tuesday, April 15, 2008

Lecture 24: Chess Programming

Chess Programming (TXT,PDF)

Lecture 23: Games II

(PDF, PS)

Lecture 22: Games

Basic game searching and alpha-beta (TXT)

Tuesday, April 08, 2008

Tomorrow's recitation change

For tomorrow's section, Owen's going to be at section H, and Daegun's going to be at section D. Also, for those who didn't realize yet, we will have a quiz on graphs, so make sure you come to the recitation. Good luck!

Tuesday office hour change

I need to move my office hour today. I will be holding it 2 hours later at 9:00-10:00, at Wean Hall 8th floor couches.

Monday, April 07, 2008

Graphs Recitation Material

The slides and handout from last recitation on graph algorithms are now posted.

Thursday, April 03, 2008

Lecture 21: Graphs IV

A more detailed exploration of depth first search. (TXT, PDF)

Wednesday, April 02, 2008

Tuesday, April 01, 2008

Thursday Office Hour Change

I need to move my office hours this Thursday on account of an evening exam. I will be holding them 30 minutes earlier at 4:30-5:30, and will be unable to stay past 5:30.

Lecture 20: Graphs III

This is a lecture on all-pairs-shortest-paths, and on minimum spanning trees. (TXT PDF)

Lecture 19: Graphs II

Single-source shortest path algorithms (PS)