# Lab: Introductory Exercises

Implement the Brute Force solution to the Movie Jobs problem in the language of your choice. This package gives you an instance generator and a visualizer written in Python. Your program should read an instance from standard input and write a solution to standard output: you can write this in the language of your choice.

How do different instances of the same size differ in result? How does your program perform as n gets larger? What could you do to speed it up?

This package gives solutions to Robot Tour written in Python.

How big an instance can exhaustive search handle? What about the two heuristic methods? How much better is a large exhaustive search than the heuristic methods? Which heuristic method gives better results on larger problems? Which solution is the hardest to read and understand? Which is easiest?