jeffdshen / grid-reductions Goto Github PK

Input: GadgetConfiguration
Output: GadgetConfiguration

Description:

1. Check if there's a path from top to bottom that only goes through the side of wires when going down, or empty spaces when going left <-> right.
2. If so, then for each wire gadget, check if the wire gadget is a part of a larger wire, get the total wire length.
3. See if each wire can be shrunk by 1 to produce a smaller valid wire.

Given a mapping of (input, gadget) -> (output, solved gadget), substitute the final state to get a solved state

Implement parser.Writer for AtomicConfiguration and Configuration

Currently only &&, ||, ! are allowed. Could use a library to customize this.

Improve on: 081f0c4

Description:

1. Create an accurate cost function: sum_over_rows_and_cols(max_over_cells_in_row_or_col(cell_cost_in_direction))
   (a) Handle large nodes
   (b) One way to test: generate some test planarizations, check if cost function is close to the LP gadget placer results.
2. Pick a set of nodes (1 to 2) to re-place, delete them, and then re-place them in the place with the min cost.
3. Remember the best cost + configuration, repeat until convergence
4. (optional) randomly allow worse configurations: https://en.wikipedia.org/wiki/Simulated_annealing

Code pointers:

1. GadgetPlanarizerInstance
2. AbstractCostFunction

Write a gadget class and a parser that reads from text files.

Allow user to allow or provide multiple orientations of the same gadget. Then the planarizer can use this to generate more optimal configurations.