Daan - User contributions [en]

Paintings from Polygons

2021-06-07T11:49:49Z

MeesterDaan: /* Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistence of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

* A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

* We got simulated annealing to work in a [http://heuristieken.nl/resources/(2020)Dahmanietal-PFPSimulatedAnnealing.pdf paper] published at ICCC'20.

Where the Really Hard Problems Aren't

2020-12-01T12:16:31Z

MeesterDaan:

==Papers==

Here is our paper [https://www.sciencedirect.com/science/article/pii/S2214716020300506 Where the Really Hard Problems Aren't.]

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

==A Different Mean==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="bottom" |[[Image:Verschovenfasetransitie.png|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
|}
</Center>

Where the Really Hard Problems Aren't

2020-12-01T12:15:38Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

==Papers==

Here is our paper [https://www.sciencedirect.com/science/article/pii/S2214716020300506 Where the Really Hard Problems Aren't.]

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==A Different Mean==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="bottom" |[[Image:Verschovenfasetransitie.png|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
|}
</Center>

CheesemanTSPReplication

2020-12-01T12:15:04Z

MeesterDaan: MeesterDaan moved page CheesemanTSPReplication to Where the Really Hard Problems Aren't

#REDIRECT [[Where the Really Hard Problems Aren't]]

Where the Really Hard Problems Aren't

2020-12-01T12:15:03Z

MeesterDaan: MeesterDaan moved page CheesemanTSPReplication to Where the Really Hard Problems Aren't

Page dedicated to "Where the Really Hard Problems Aren't"

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==Papers==

Here is our paper [https://www.sciencedirect.com/science/article/pii/S2214716020300506 Where the Really Hard Problems Aren't.]

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

==A Different Mean==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="bottom" |[[Image:Verschovenfasetransitie.png|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
|}
</Center>

Where the Really Hard Problems Aren't

2020-12-01T12:13:31Z

MeesterDaan: /* Papers */

Paintings from Polygons

2020-09-08T20:05:43Z

MeesterDaan: /* Misc */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

* A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

* We got simulated annealing to work in a [http://heuristieken.nl/resources/(2020)Dahmanietal-PFPSimulatedAnnealing.pdf paper] published at ICCC'20.

Paintings from Polygons

2020-09-08T20:05:07Z

MeesterDaan: /* Misc */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

* A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

* We got simulated annealing to work in a [http://heuristieken.nl/resources/(2020)Dahmanietal-PFPSimulatedAnnealing paper published at ICCC'20].

PPA & Hard Hamiltonian Graphs

2020-06-14T12:47:28Z

MeesterDaan: /* Errata */

==Paper==

Here is our [http://heuristieken.nl/resources/(2020)Sleegers&VandenBerg-PPAforhardHamiltoniangraphs.pdf paper].

==Errata==

The title of the paper is somewhat misleading; we're actually no looking for hard Hamiltonian graphs, but hard Hamiltonian problem instances, and the result of that are actually non-Hamiltonian graphs only.

On the first page it says "The hardest graphs reside in between, right around the Komlos-Szemeredi bound of average degreev·ln(v) +v·ln(ln(v)) edges". This is a mixeup. There are two possibilities:

1) The hardest graphs reside in between, right around the Komlos-Szemeredi bound of average degree ln(v) +ln(ln(v)).

2) The hardest graphs reside in between, right around the Komlos-Szemeredi bound of 1/2v·ln(v) + 1/2v·ln(ln(v)) edges.

Paintings from Polygons

2020-06-11T22:28:06Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

Paintings from Polygons

2020-06-11T22:22:15Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi2.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine2.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

PPA & Hard Hamiltonian Graphs

2020-05-13T21:08:36Z

MeesterDaan:

PPA parameterization

2020-04-29T21:22:23Z

MeesterDaan: Created page with " ==Paper== Here is our [http://heuristieken.nl/resources/(2020)DeJonge&VandenBerg-PPAparameterization.pdf paper]."

==Paper==

Here is our [http://heuristieken.nl/resources/(2020)DeJonge&VandenBerg-PPAparameterization.pdf paper].

PPA & Hard Hamiltonian Graphs

2020-04-29T21:21:26Z

MeesterDaan:

==Paper==

Here is our [http://heuristieken.nl/resources/(2020)Sleegers&VandenBerg-PPAforhardHamiltoniangraphs.pdf paper].

PPA & Hard Hamiltonian Graphs

2020-04-29T21:21:03Z

MeesterDaan:

==Paper==

Here is our [http://heuristieken.nl/resources/(2020)Sleegers&VandenBerg-PPAforhardHamiltoniangraphs paper].

Where the Really Hard Problems Aren't

2020-04-26T13:06:25Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==Papers==

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

==A Different Mean==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="bottom" |[[Image:Verschovenfasetransitie.png|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
|}
</Center>

File:Verschovenfasetransitie.png

2020-04-26T13:04:23Z

MeesterDaan:

Where the Really Hard Problems Aren't

2020-04-26T13:03:02Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==Papers==

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

==A Different Mean==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="bottom" |[[Image:verschovenfasetransitie|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
|}
</Center>

PPA & Hard Hamiltonian Graphs

2020-04-24T19:53:25Z

MeesterDaan: Created page with " ==Paper== Here is our [http://heuristieken.nl/resources/(2020)DeJonge&VandenBerg-PPAparameterization.pdf paper]."

==Paper==

Here is our [http://heuristieken.nl/resources/(2020)DeJonge&VandenBerg-PPAparameterization.pdf paper].

Paintings from Polygons

2020-04-24T19:52:06Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

==Misc==

A simplified version of the problem was proven to be [http://heuristieken.nl/resources/(2020)VandenBerg-SimplifiedPaintingsfromPolygonsisNPHard.pdf NP-hard] in 2020.

Paintings from Polygons

2019-12-26T10:56:53Z

MeesterDaan: /* PolygonConstellation */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistence of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-26T10:56:07Z

MeesterDaan: /* Errata */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncorrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-26T10:55:26Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-25T14:38:46Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Mundi (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-25T12:10:57Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Muni (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

==Resources & Media==

A [https://www.youtube.com/watch?v=u91gRGY8ElQ movie clip] of the algorithm at work.

* [graph typicalruns][graph best end results][link to data records] ... available on request.

* Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-25T12:09:57Z

MeesterDaan: /* Media */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Muni (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Resources & Media==

[https://www.youtube.com/watch?v=u91gRGY8ElQ]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-25T12:08:31Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Muni (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Lady with an Ermine (1490) by Leonardo da Vinci.]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Media==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-12-25T12:06:46Z

MeesterDaan: /* New Paintings */

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Salvator
!Lady Ermine
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Salvator Muni (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Media==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

File:180x240LadyErmine.png

2019-12-25T12:05:23Z

MeesterDaan:

File:180x240SalvatorMundi.png

2019-12-25T12:04:56Z

MeesterDaan:

Paintings from Polygons

2019-12-25T12:04:15Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

==New Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240SalvatorMundi.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240LadyErmine.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Media==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Where the Really Hard Problems Aren't

2019-12-17T19:54:50Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

==Interactive Results==

Here are some [https://travelingsalesman.nl/ interactively viewable results].

==Papers==

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

ASQAS-34

2019-12-14T12:21:50Z

MeesterDaan:

==Paper==

I'm still working on this page, but [http://www.heuristieken.nl/resources/2016Braametal-AlmostSquares.pdf our '''paper''' is here]. I (Daan van den Berg) welcome all feedback you might have. Look me up in the UvA-directory, on LinkedIn or FaceBook.

==What is ASQAS-34 ?==
<Center>
{| align="justify" | style=" align="top"; text-align:center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="top"|
ASQAS-34 is a '''Perfect Rectangle Packing Problem'''. In general, rectangle packing problems involve putting a set of rectangles inside a rectangular frame (often called a "container"). Those problems requires that you find the smallest container possible, hence it is a '''constrained optimization problem'''. In ''perfect'' rectangle packing problems, the frame has exactly the same area of all the rectangles summed up. This means that if it fits, it fits perfectly, without free space or overlap in the rectangles, and a smaller container does not exist. Therefore, perfect rectangle packing problems such as ASQAS-34, are '''constraint satisfaction problems ''' (or equivalently: a decision problem).

There are five ASQAS problems in total, and they all consist of a serie of rectangles from 1x2, 2x3, 3x4 to NxN+1 which need to be fitted into an almost-square frame. Four ASQAS problems had already been solved (ASQAS-1, ASQAS-3, ASQAS-8 and ASQAS-20). In our paper, we show that ASQAS-34 is the last instance, and that it can be solved. This is somewhat different from consecutive squares-in-squares which has only two instances (1 and 24), the first one being completely trivial and [http://mathworld.wolfram.com/PerfectSquareDissection.html the second one being unsolvable].

|valign="top" |[[Image:Asqas34los2_k.png|frame|This is Asqas-34: consecutive almost-square tiles to be fit in an almost-square frame. There are 5 instances of ASQAS, and ASQAS-34 was the only unsolved instance yet.]]

|}
</Center>

==How did you solve it?==
<Center>
{| align="justify" | style=" align="top"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-

|valign="top"|

With 10<SUP>48</SUP> possible configurations, this problem was way too big to solve on a stand-alone computer. So we needed some tricks to nudge the odds in our favour. Such tricks are called "heuristics" if they involve an element of guessing, and "optimizations" if they just speed up the computation process.

We pryed a valuable heuristic out of a smaller instance, the ASQAS-20. This instance had 54,992 solutions, most of which had borders consisting of large tiles. We figured that this might be true for the ASQAS-34 instance too, so we decided to first make all borders of 12 tiles and this is where we got lucky. Combinatorially speaking, we could make about 10<SUP>21</SUP> of these 12-tile borders. But a single day's work showed that only 4,425,341 borders actually fitted the frame. That's less than 0.00000000001%. So that's a huge improvement, but 4,4 million borders is still a lot. Basically, you still have to solve 4,4 million puzzles of 22 tiles.

|valign="top" |[[Image:ASQAS20heur.jpg|frame|link=Heuristieken|Most of ASQAS-20 solutions have large border tiles. In fact, tiles 14x15, 17x18, 18x19, 19x20 are in the border of nearly all 54,992 solutions.]]

|}

</Center>

==How did you solve the 4,4 million borders?==
<Center>
{| align="justify" | style=" align="top"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="top"|
So then we needed to fill up the 4,4 million borders with their of 22 tiles. Combinatorially speaking, even just one puzzle of 22 tiles is too difficult to solve on a single computer, leaving us with a serious challenge. To tackle this we programmed an 'interior solver' - a small, efficient computer program capable of puzzling the 22 remaining tiles inside the borders. We ran several dozen instances of this solver on scientific supercomputers throughout The Netherlands, and set up a central server to distribute the borders, in batches of 1,000 over the supercomputers.

Such a distributed approach, and especially reserving room for error, is highly recommendable for a project of this scale because stuff goes wrong all the time. You find out you made a mistake somewhere. Some of your files turn out to be corrupt. A remote server is shut down for maintenance. A system administrator keeps killing your processes because your continuously processor-pounding programs look kind of suspicious to him. It's really not worth it to start all over, so count on these things to happen and prepare to restart any given batch at any given time, without affecting the already completed results.

|valign="top" |[[Image:solvingInterior_k.gif|frame|link=Heuristieken|A distributed approach: All 12-tiles borders were constructed first, then put in files and distributedly solved by 'supercomputers' around the country. It took 55 days using 1,000 solvers to find all 15 solutions with 12-tile borders.]]

|}
</Center>

==So, is this a hard problem?==
<Center>
{| align="justify" | style=" align="top"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="top"|
That's a very difficult question. I don't know. It took us 55 full-time calculation days on 1,000 computer cores to find only 15 solutions, and we think we had a pretty clever approach. But then there's [http://webhost.services.iit.cnr.it/staff/giovanni.resta/ Giovanni Resta], an Italian researcher who solved the exact same problem on his desktop computer. So is Resta brilliant, or just lucky? Probably a little bit of both. Or maybe the problem isn't so hard after all. But if it wasn't that hard, why did it take us 80,000 computer days? I just don't know, to be honest.

In general, it's very hard to say whether a problem is hard or not. For some problems (or ''problem instances'', to be precise), we have a few hallmarks that make them easy: small state-space, highly constrained, high solution density, availability of clues or good heuristics. But the absence of these ease-hallmarks still doesn't mean a problem is hard; it means we don't know.

This problem has none of these hallmarks, or better: we haven't identified any. But since Resta's results and ours are so contradictory, we have absolutely no idea whether this problem is hard or easy. Maybe it depends on how lucky your are, or on where you look.

|valign="top" |[[Image:2oplossingen_k.jpg|frame|Left: solution found on the server of [http://perceptualdynamics.be/index.php/staff/133-prof-dr-cees-van-leeuven Cees van Leeuwen]'s [[http://perceptualdynamics.be lab for perceptual dynamics]] in Leuven. Thanks to Marco Maas for helping out too. Right: solution found on the astronomical supercomputer ASTRON in Dwingeloo, The Netherlands]]

|}
</Center>

==Who are you guys?==
<Center>
{| align="justify" | style=" align="top"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
|valign="top"|
We are a genuine VU-UvA consortium. Mark, Florian and Emiel were VU-students when we started this work. They're all professionals now, and Emiel does some occasional work in proofreading Heuristics-reports at the UvA. That's where I work, in the [http://www.mprog.nl minor programming] where we teach the course of Heuristics. That course was originally built up at the VU back when I worked there with Guszti Eiben and Bushra Malik. Sandjai, our senior author, also works at the VU as a Full Professor Business Analytics. He works on state-space reductions which is exactly the trick we deployed to solve ASQAS-34. So there's connections all over, we're truly a VU-UvA team.

|valign="top" |[[Image:thatsUs_k.jpg|frame|link=Heuristieken|Left-to-right: Mark Moes, Emiel Suilen & Florian Braam who did most of the ground work. Bottom right is me (Daan van den Berg), I did coordination and wrote the paper's first draft. Top right is Sandjai Bhulai who also did some writing and took care of the entire publication process. A good team.]]

|}
</Center>

==Corrections, trivia & Errata ==

* I (Daan van den Berg) am mentioned as the first author of this paper. I am not. I am fourth author, and Florian Braam, Mark Moes and Emiel have done all the ground work in solving this problem, and should be authors one, two and three respectively. I did most of the writing, and Sandjai did the editing and submission.

==More==

* So our [http://www.heuristieken.nl/resources/2016Braametal-AlmostSquares.pdf our '''paper''' is here].

* This story also appeared in [https://newscientist.nl/nieuws/informatici-onthullen-oplossing-inpakprobleem/ NewScientist] (in Dutch).

* and in [https://www.folia.nl/wetenschap/106236/uva-vu-informatici-lossen-als-eerst-wiskundig-inpakprobleem-op Folia] (in Dutch).

Paintings from Polygons

2019-10-10T12:00:16Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Media==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a uncirrected textual remnant from an earlier probe. In general, we have been looking for a good way to transfer the PPA-algorithm to this problem, and many adaptations are possible.

Paintings from Polygons

2019-10-10T10:55:24Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==Media==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a non-removed remnant from an earlier probe.

Paintings from Polygons

2019-10-10T10:54:46Z

MeesterDaan:

This page is dedicated to the EVOSTAR'19 publication "Paintings, Polygons and Plant Propagation".

==Paintings==

These are the target bitmaps used in our experimental runs.

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Mona Lisa
!Mondriaan
!Klimt
!Bach
|-
|valign="top" |[[Image:180x240MonaLisa.png|frame|Mona Lisa (1503) by Leonardo da Vinci.]]
|valign="top" |[[Image:180x240Mondriaan.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan.]]
|valign="top" |[[Image:180x240Klimt.png|frame|The Kiss (1908) by Gustav Klimt.]]
|valign="top" |[[Image:180x240Bach.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman.]]
|}
</Center>

<Center>
{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
!Dali
!Jackson Pollock
!Starry Night
|-
|valign="top" |[[Image:240x180StarryNight.png|frame|The Starry Night (1889) by Vincent Van Gogh.]]
|valign="top" |[[Image:240x180JacksonPollock.png|frame|Convergence (1952) by Jackson Pollock.]]
|valign="top" |[[Image:240x180Dali.png|frame|The Persistance of Memory (1931) by Salvador Dali.]]
|}
</Center>

Painting provenance (recovered 31-9-2018):

BACH: Wikipedia, Public Domain (https://en.wikipedia.org/wiki/Johann_Sebastian_Bach)

DALI: Wikiart, Fair Use (https://www.wikiart.org/en/salvador-dali/the-persistence-of-memory-1931)

MONA LISA: https://www.wikiart.org/en/leonardo-da-vinci/mona-lisa

MONDRIAAN: https://www.wikiart.org/en/piet-mondrian/composition-with-red-blue-and-yellow-1930

POLLOCK: https://www.wikiart.org/en/jackson-pollock/convergence-1952

STARRY NIGHT: https://www.wikiart.org/en/vincent-van-gogh/the-starry-night-1889

KLIMT: https://www.wikiart.org/en/gustav-klimt/the-kiss-1908

Get [http://heuristieken.nl/resources/PaauwVandenBerg_paintings.zip all the painting bitmaps] in one zip file.

==PolygonConstellation==

These are the constellations from our last figure:

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="3" |[[Image:180x240MonaLisaPoly.png|frame|Mona Lisa (1503) by Leonardo da Vinci. (Done with Simulated Annealing)]]
| colspan="3" |[[Image:180x240MondriaanPoly.png|frame|Composition with Red, Yellow and Blue (1930) by Piet Mondriaan. (Done with Hillclimber)]]
| colspan="3" |[[Image:180x240KlimtPoly.png|frame|The Kiss (1908) by Gustav Klimt. (Done with Plant Propagation)]]
| colspan="3" |[[Image:180x240BachPoly.png|frame|Portrait of Johann Sebastian Bach (1746) by Elias Gottlieb Haussman. (Done with Hillclimber)]]
|}
</Center>

<Center>
{|class="wikitable"| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"
|-
| colspan="4" |[[Image:240x180StarryNightPoly.png|frame|The Starry Night (1889) by Vincent Van Gogh. (Done with Plant Propagation)]]
| colspan="4" |[[Image:240x180JacksonPollockPoly.png|frame|Convergence (1952) by Jackson Pollock. (Simulated Annealing)]]
| colspan="4" |[[Image:240x180DaliPoly.png|frame|The Persistance of Memory (1931) by Salvador Dali. (Done with Hillclimber)]]
|}
</Center>

Here's our [http://heuristieken.nl/resources/PaintingsFromPolygons.zip source code].

==PolygonConstellation==

[A movie clip should come here]

[graph typicalruns][graph best end results][link to data records] ... available on request.

==Errata==

* In equation (7), the factor (1−fi) should be just (fi). The typo is just in the paper, not in the source code, and therefore doesn't affect the results (see organisms.py, line 138).

* In equation (9), the factor 9v/4 is incorrect; the experiments were done with 13v/5. The factor 1/nmax from the same formula was never in the experiment (see organisms.py, line 143). It is most likely a non-removed remnant from an earlier probe.

Where the Really Hard Problems Aren't

2019-10-07T21:57:22Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

==Papers==

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

==Resources==

Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.

Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.

Where the Really Hard Problems Aren't

2019-10-06T23:30:48Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.].

Where the Really Hard Problems Aren't

2019-10-06T23:29:56Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurnished version of Little et al.'s paper on branch and bound for TSP.].

Where the Really Hard Problems Aren't

2019-10-06T23:27:16Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf Little et al.'s paper on branch and bound for TSP.].

Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-[refurbished]AlgorithmforTSP.pdf a refurnished version of Little et al.'s paper on branch and bound for TSP.].

Where the Really Hard Problems Aren't

2019-10-06T21:43:48Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

Here are the [http://www.heuristieken.nl/resources/CheesemanLittle.zip Papers by Cheeseman et al, little et al].

Where the Really Hard Problems Aren't

2019-10-06T21:42:17Z

MeesterDaan:

Page dedicated to "Where the Really Hard Problems Aren't"

Here are the [http://www.heuristieken.nl/resources/Cheeseman&Little .zip Papers by Cheeseman et al, little et al].

Where the Really Hard Problems Aren't

2019-10-06T21:41:36Z

MeesterDaan: Created page with " Page dedicated to "Where the Really Hard Problems Aren't" Here are the [http://www.heuristieken.nl/resources/Cheeseman&Little.zip Papers by Cheeseman et al, little et al]."

Page dedicated to "Where the Really Hard Problems Aren't"

Here are the [http://www.heuristieken.nl/resources/Cheeseman&Little.zip Papers by Cheeseman et al, little et al].

Afternoon

2019-06-17T20:04:39Z

MeesterDaan: /* An Afternoon of Algorithmic Protein Folding */

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:aankondiging.jpg|thumb|upright=3]]
|}

==An Afternoon of Algorithmic Protein Folding==

On '''June 19th 2019 from 13:00 till 17:00''' (max) we'll be organising a thematic afternoon of algorithmic protein folding '''at Science Park, in room C3.163'''. We'll be having some speakers, some student projects and a really nice competition by Bas Terwijn (below), lecturer in Heuristics. If you want to join us, or maybe even contribute,

please [https://forms.gle/8XuTD5TFTeCRATcJ9 register] so we can arrange for enough space. If you're not sure, just put "not sure" in the comment box.

{| border=1
! Programme
!
!
|-
| 13:00
| Daan van den Berg
| Exact and non-exact algorithms
|-
| 13:25
| Peter Bolhuis
| Protein folding & energy landscapes
|-
| 14:00
| Maurits Dijkstra (VU)
| "The characteristics of molten globule states and folding pathways strongly depend on the sequence of a protein"
|-
| 14:30
| Coffee
| break?
|-
| 14:50
| Michael, Ruby & Sophie
| Hydro in the middle
|-
| 15:30
| Maybe another speaker?
| With some nice topic?
|-
| 16:00
| Bas Terwijn
| Algorithms for protein folding
|-
| 16:30
| Competition: results
| #winning
|}

For questions contact [https://www.uva.nl/profiel/b/e/d.vandenberg/d.vandenberg.html Daan van den Berg].

==Competition==

Are you a good protein folder? Take part in our competition by Heuristics teachers Bas Terwijn and Quinten van der Post. A set of 26 proteins, ranging from 14 to 2000 amino acids in various dimensionalities, need to folded as well as possible. The proteins, and some python source code for objective values and visualization, come in a [http://heuristieken.nl/resources/Protein_Folding_Competition.zip downloadable package].

After finishing your folds, uniquely identify them by your name and [https://protein.quinner.nl/ submit here].

For questions contact [https://www.uva.nl/profiel/t/e/b.terwijn/b.terwijn.html Bas Terwijn].

==Protein Folding in Minor Programmeren ==

The idea for a meetup stems from the course of Heuristics in the Minor Programming here at UvA. One of the cases involves developing algorithms for folding proteins. Click the image (warning: Dutch).

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:proteinpowder.jpg|frame|link=Protein Pow(d)er|Bepaal de optimale vouwing van een eiwit.]]
|}

Afternoon

2019-06-16T22:12:56Z

MeesterDaan: /* An Afternoon of Algorithmic Protein Folding */

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:aankondiging.jpg|thumb|upright=3]]
|}

==An Afternoon of Algorithmic Protein Folding==

On '''June 19th 2019 from 13:00 till 17:00''' (max) we'll be organising a thematic afternoon of algorithmic protein folding '''at Science Park, in room C3.138'''. We'll be having some speakers, some student projects and a really nice competition by Bas Terwijn (below), lecturer in Heuristics. If you want to join us, or maybe even contribute,

please [https://forms.gle/8XuTD5TFTeCRATcJ9 register] so we can arrange for enough space. If you're not sure, just put "not sure" in the comment box.

{| border=1
! Programme
!
!
|-
| 13:00
| Daan van den Berg
| Exact and non-exact algorithms
|-
| 13:25
| Peter Bolhuis
| Protein folding & energy landscapes
|-
| 14:00
| Maurits Dijkstra (VU)
| "The characteristics of molten globule states and folding pathways strongly depend on the sequence of a protein"
|-
| 14:30
| Coffee
| break?
|-
| 14:50
| Michael, Ruby & Sophie
| Hydro in the middle
|-
| 15:30
| Maybe another speaker?
| With some nice topic?
|-
| 16:00
| Bas Terwijn
| Algorithms for protein folding
|-
| 16:30
| Competition: results
| #winning
|}

For questions contact [https://www.uva.nl/profiel/b/e/d.vandenberg/d.vandenberg.html Daan van den Berg].

==Competition==

Are you a good protein folder? Take part in our competition by Heuristics teachers Bas Terwijn and Quinten van der Post. A set of 26 proteins, ranging from 14 to 2000 amino acids in various dimensionalities, need to folded as well as possible. The proteins, and some python source code for objective values and visualization, come in a [http://heuristieken.nl/resources/Protein_Folding_Competition.zip downloadable package].

After finishing your folds, uniquely identify them by your name and [https://protein.quinner.nl/ submit here].

For questions contact [https://www.uva.nl/profiel/t/e/b.terwijn/b.terwijn.html Bas Terwijn].

==Protein Folding in Minor Programmeren ==

The idea for a meetup stems from the course of Heuristics in the Minor Programming here at UvA. One of the cases involves developing algorithms for folding proteins. Click the image (warning: Dutch).

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:proteinpowder.jpg|frame|link=Protein Pow(d)er|Bepaal de optimale vouwing van een eiwit.]]
|}

Afternoon

2019-06-15T13:31:27Z

MeesterDaan: /* An Afternoon of Algorithmic Protein Folding */

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:aankondiging.jpg|thumb|upright=3]]
|}

==An Afternoon of Algorithmic Protein Folding==

On '''June 19th 2019 from 13:00 till 17:00''' (max) we'll be organising a thematic afternoon of algorithmic protein folding. We'll be having some speakers, some student projects and a really nice competition by Bas Terwijn (below), lecturer in Heuristics. If you want to join us, or maybe even contribute,

please [https://forms.gle/8XuTD5TFTeCRATcJ9 register] so we can arrange for enough space. If you're not sure, just put "not sure" in the comment box.

{| border=1
! Programme
!
!
|-
| 13:00
| Daan van den Berg
| Exact and non-exact algorithms
|-
| 13:25
| Peter Bolhuis
| Protein folding & energy landscapes
|-
| 14:00
| Maurits Dijkstra (VU)
| "The characteristics of molten globule states and folding pathways strongly depend on the sequence of a protein"
|-
| 14:30
| Coffee
| break?
|-
| 14:50
| Michael, Ruby & Sophie
| Hydro in the middle
|-
| 15:30
| Maybe another speaker?
| With some nice topic?
|-
| 16:00
| Bas Terwijn
| Algorithms for protein folding
|-
| 16:30
| Competition: results
| #winning
|}

For questions contact [https://www.uva.nl/profiel/b/e/d.vandenberg/d.vandenberg.html Daan van den Berg].

==Competition==

Are you a good protein folder? Take part in our competition by Heuristics teachers Bas Terwijn and Quinten van der Post. A set of 26 proteins, ranging from 14 to 2000 amino acids in various dimensionalities, need to folded as well as possible. The proteins, and some python source code for objective values and visualization, come in a [http://heuristieken.nl/resources/Protein_Folding_Competition.zip downloadable package].

After finishing your folds, uniquely identify them by your name and [https://protein.quinner.nl/ submit here].

For questions contact [https://www.uva.nl/profiel/t/e/b.terwijn/b.terwijn.html Bas Terwijn].

==Protein Folding in Minor Programmeren ==

The idea for a meetup stems from the course of Heuristics in the Minor Programming here at UvA. One of the cases involves developing algorithms for folding proteins. Click the image (warning: Dutch).

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:proteinpowder.jpg|frame|link=Protein Pow(d)er|Bepaal de optimale vouwing van een eiwit.]]
|}

Afternoon

2019-06-15T13:30:47Z

MeesterDaan: /* An Afternoon of Algorithmic Protein Folding */

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:aankondiging.jpg|thumb|upright=3]]
|}

==An Afternoon of Algorithmic Protein Folding==

On '''June 19th 2019 from 13:00 till 17:00''' (max) we'll be organising a thematic afternoon of algorithmic protein folding. We'll be having some speakers, some student projects and a really nice competition by Bas Terwijn (below), lecturer in Heuristics. If you want to join us, or maybe even contribute,

please [https://forms.gle/8XuTD5TFTeCRATcJ9 register] so we can arrange for enough space. If you're not sure, just put "not sure" in the comment box.

{| border=1
! Programme
!
!
|-
| 13:00
| Daan van den Berg
| Exact and non-exact algorithms
|-
| 13:25
| Peter Bolhuis
| Protein folding & energy landscapes
|-
| 14:00
| Maurits Dijkstra (VU)
| "The characteristics of molten globule states and folding pathways strongly depend on the sequence of a protein"
|-
| 14:30
| Coffee
| break?
|-
| 14:50
| Michael, Ruby & Sophie
| Hydro in the middle
|-
| 15:30
| Michael, Ruby & Sophie
| Hydro in the middle
|-
| 16:00
| Bas Terwijn
| Algorithms for protein folding
|-
| 16:30
| Competition: results
| #winning
|}

For questions contact [https://www.uva.nl/profiel/b/e/d.vandenberg/d.vandenberg.html Daan van den Berg].

==Competition==

Are you a good protein folder? Take part in our competition by Heuristics teachers Bas Terwijn and Quinten van der Post. A set of 26 proteins, ranging from 14 to 2000 amino acids in various dimensionalities, need to folded as well as possible. The proteins, and some python source code for objective values and visualization, come in a [http://heuristieken.nl/resources/Protein_Folding_Competition.zip downloadable package].

After finishing your folds, uniquely identify them by your name and [https://protein.quinner.nl/ submit here].

For questions contact [https://www.uva.nl/profiel/t/e/b.terwijn/b.terwijn.html Bas Terwijn].

==Protein Folding in Minor Programmeren ==

The idea for a meetup stems from the course of Heuristics in the Minor Programming here at UvA. One of the cases involves developing algorithms for folding proteins. Click the image (warning: Dutch).

{| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;"

|valign="top" |[[Image:proteinpowder.jpg|frame|link=Protein Pow(d)er|Bepaal de optimale vouwing van een eiwit.]]
|}

A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances

2019-06-15T10:53:32Z

MeesterDaan: /* Paper */

==Paper==

Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf paper].

'''Corrections, additions & developments:'''

CORRECTION: I misspelled the name of Edward Reingold as "Rheingold", possibly being confused by the Wagner opera.

ADDITION to page 93: "when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood "a higher degree vertex" means "a vertex which is not already in the path, that has the largest number of edges ''to unvisited vertices''". In other words: the priority list of available vertices is determined and sorted during each recursion call.

==Interactive Graphs==

The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].

==Source Data for Interactive Graphs==

Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.

==Source Code for the Algorithms==

And here is the [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip source code] of the algorithms.

A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances

2019-06-15T10:52:40Z

MeesterDaan: /* Paper */

==Paper==

Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf paper].

'''Corrections, additions & developments:'''

CORRECTION: I misspelled the name of Edward Reingold as "Rheingold", possibly being confused by the Wagner opera.

ADDITION to page 93: "when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood 'a higher degree vertex' means 'a vertex which is not already in the path, that has the largest number of edges ''to unvisited vertices'''. In other words: the priority list of available vertices is determined and sorted during each recursion call.

==Interactive Graphs==

The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].

==Source Data for Interactive Graphs==

Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.

==Source Code for the Algorithms==

And here is the [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip source code] of the algorithms.

A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances

2019-06-15T10:52:08Z

MeesterDaan: /* Paper */

==Paper==

Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf paper].

'''Corrections, additions & developments:'''

CORRECTION: I misspelled the name of Edward Reingold as "Rheingold", possibly being confused by the Wagner opera.

ADDITION: On page 93: "2) when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood 'a higher degree vertex' means 'a vertex which is not already in the path, that has the largest number of edges ''to unvisited vertices'''. In other words: the priority list of available vertices is determined and sorted during each recursion call.

==Interactive Graphs==

The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].

==Source Data for Interactive Graphs==

Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.

==Source Code for the Algorithms==

And here is the [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip source code] of the algorithms.