metadynamic-programming

Automatized proof of NP-complexity of 2D locally-dependant problems

Bachelors thesis, 2008

http://rain.ifmo.ru/~dvorkin/science/bachelors.pdf (in Russian)

https://www.slideshare.net/mikhail.dvorkin/automated-npcompleteness-proof-for-2d-problems (in Russian)

WIP: notes from 2008 folder, as is

• LongWriter should throw an exception when long overflows
• search over all wires in Kakuro
• MyHashProfileCollection.toArray() shouldn't create new array
• BeatifulStoreFieldMetaProfile

Mineseeper OR:

11...1
..1..1
1...11
01..11
0.1..1
00...1

Minesweeper Splitter:

111.1
....1
1..11
0.111
00..1
00..1