HW #1: Brute Force Search Algorithms Sample Solution
Nathan Sturtevant · 2010
This document describes the results for the first homework assignment in COMP-4704-1, Fall 2010. In particular, we perform an analysis of three brute-force search algorithms, BFS, DFS and DFID. We compare the performance of these algorithms on a grid-based domain, a n-ary tree, and on the sliding-tile puzzle. Our results confirm the predicted performance from lecture.