CS 188: Artificial Intelligence Fall 2009 Lecture 3. Try pair programming, not divide-and-conquer. Detailed pseudocode. Search Gone Wrong? Announcements. Try pair programming, not divide-and-conquer. Detailed pseudocode. 2 Example Search Tree Search: Expand out possible plans. Introduction to Algorithms Third Edition The MIT Press. 4 Divide-and-Conquer 65. 33.4 Finding the closest pair of points 1039. Programming Abstractions in C++. these courses can use it as both a tutorial and a reference. The power of divide-and-conquer strategies. Dynamic programming In the preceding chapters we have seen some elegant design principlesŠsuch as divide-and-conquer. Here is the algorithm. CMSC 451: Closest Pair of Points Slides By. algorithm: just check ever pair of points. Can we do it faster? Seems. Divide the region up into squares with sides. Pseudocode that is similar to the syntax of structured programming. 2.8.3 Solution of divide-and-conquer recurrences. 6.9 The Closest Pair Problem. 5 marks for tutorial participation. Divide and Conquer – A Tiling problem – Strassen’s Matrix Product Algorithm – Finding closest pair of.