1. dispatches
  2. National Debate Tournament Update

National Debate Tournament Update

By stcynic on March 27, 2006.

I've been trying like hell to find up to date information on the National Debate Tournament. The most recent information I could find last night was after the first elimination round when it was down to 16 teams. The way it works at NDT is that everyone with a 5-3 record goes to the elimination rounds and they have a partial double octofinal. In this case they had 30 teams with 5-3 records or better so the top two teams received a bye in the first elimination round and the next 28 debated each other to determine the other 14 teams that would make the octofinals. Apparently, Emory's top team and Michigan State's top team received byes, presumably with 8-0 records. The other 28 teams debated the double and the results were:

Dartmouth CS def. Redlands SZ
Kentucky JS def. Idaho State DY 3-2
Fullerton MM def. Mary Washington SW
Northwestern BC def. Harvard LP
Dartmouth BM def. Emory CL
Kansas CJ def. George Washington LW
Harvard KM def. Berkeley LR 5-0
Whitman SS def. West Georgia LM 4-1
Wake Forest CH def. Harvard AR 5-0
Northwestern DD def. Emory HH
Berkeley BW def. UMKC CG
Oklahoma CJ def. Iowa LS
Wayne State FM def. Missouri State BM
Whitman BM def. USC IS

I don't know the pairings for the octofinal round, but I'll try and find more information this morning. By the way, the last update I saw that included the "#1 ranked team in the country", Liberty University, had them at 2-4 and already out of the running. Praise the lord and pass the permutations.

Tags
Uncategorized

More like this

Implementing Compact Binary Heaps

Last post, I described the basic idea of the binary heap data structure. But I didn't talk about how to implement it - and there's a very cool way of implementing it - optimally space efficient, very fast, and with respectable cache locality for moderate sized datasets.

The Basic Balanced Search Tree: Red-Black trees.

During my Haskell tutorial, I used balanced binary search trees as an example. I've had people write to me asking me to write about that in a non-functional

Interesting Items in Dover Briefs

There are many compelling arguments made in the briefs filed by the plaintiffs in the Dover trial. I'll post a few excerpts of some of the more interesting ones.

Rotating Ciphers

So, last time, we looked at simple substitution ciphers. In a substitution cipher, you take each letter, and pick a replacement for it. To encrypt a message, you just substitute the replacement for each instance of each letter.

Ethan-

Wake Forest beating Harvard (though not the top team from Harvard, mind you) is not that unusual. Wake Forest is a traditional powerhouse in college debate. I don't know how good they are this year, but they're a regular team in the outrounds at nationals.