Daniël Staal
daniel.staal@hotmail.com
30/06/2016

The case is Chips & Circuits. A number of gates placed inside a print have to be connected in an optimal way. A print is square shaped and is always settled in the bottom layer of a 3-dimensional cuboidal grid with a total of 7 layers. Therefore each gate can be connected upto a maximum of 5 other gates(south, west, east, north and up a layer). The main objective will be to find an as low as possible sum of all the paths lengths and to find a solution for each netlist, the list of connections to be made, on a particular print.

• Use the largest print (18x17x7) and create 50 random gate placements in a print. For every configuration 50 random netlists could be created and the program tries to solve each netlist in each print.
• Create a program that is user friendly.

• Program runs in a Tkinter application, launched by calling python App.py
• Results from a database are showed to the user

Standard given netlists, prints. Python (libraries)

A*, visualisation (matplotlib), path deletion algorithms, hill climber

The main problems that might occur can be split into two categories: too high time complexity and no solution is found

All the rights to the content of this repository belong to Daniël Staal. Any distribution without permission is prohibited and behold a violation of UvA law 46 paragraph 9.