Dutch / Nederlands
Site map

I write, therefore I am

With this variation on a famous statement by the philosopher Descartes, I would like to express that writing about what happens in my life is important to me.

Friday, July 30, 2015


At 13:43, I bought the book Zwerver by Johan Kelder from bookshop Broekhuis for € 2.50.

Wednesday, July 29, 2015

Complexity of connection games

On July 18, I wrote about the complexity of Havannah versus Hex and said I would be working on a formalization of connection games. I made it a little broader, and wrote something on the formalization of abstract strategy games, which is actually a rewrite of a formalization of Havannah that I wrote some years ago. Yesterday, I found Havannah and TwixT are PSPACE-complete. It was already known that Hex is PSPACE-complete. According to the Wikipedia page about game complexity, Havannah (size 10) has a higher complexity than Hex (size 11). The numbers for Hex are from the article Games solved: Now and in the future by H.Jaap van den Herik, Jos W.H.M. Uiterwijk, and Jack van Rijswijck, which quotes the master thesis Computer Hex: Are bees better than fruitflies? by Jack van Rijswijck as it source. But after a quick scan through the thesis, I did not find those numbers. Possibly they are taken from one of the referenced articles. That Havannah (size 10) has a higher complexity than Hex (size 11) could be the result of the fact that the first more than double the positions.


Saturday, July 25, 2015

Flowers in magnolia

I noticed some flowers in our magnolia. Many of them are in new branches. Here a picture of one of the flowers.

Friday, July 24, 2015


Thursday, July 23, 2015

Institute for art history

Today, Peter Struycken and I visited the Netherlands Institute for Art History, also known asl RKD in Dutch. On forehand, we had made some requests about the materials we wanted to see, but soon it became clear that our small selection was far too large to be studied in one day. We started to work on the notes that Carel Blotkamp compiled for a catalogue of works, which, as it seems, was used for the 1974 exhibition. For this he send forms to all people owning works of Peter Struycken. Many of the works were know to me, but we also found some works that I had never seen before. Our greatest find was a panorama picture of P. Struycken - Structuur '67 exhibition on the back of which Peter had written all the Roman numbers of the works. This might resolve some of the riddles with respect to the Structuur '76 works. Peter also told me about the research he is doing with respect to the use of colours starting from the early Greeks in 500 BC.

Monday, July 20, 2015


At 13:10, I bought the book Omgaan met kunst en natuur: Jo en Marlies Eyck in Wijlre with text by Henk van Os and photographs by Kim Zwarts from charity shop Het Goed for € 1.00 (including a € 0.05 tip). It contains pictures from to works by Peter Struycken. Op page 22 there is a picture of Komputerstrukturen 2 under the title Computerstructuur zwart wit 4-69. This is the only published picture of this work that I know of. There is a picture from the Struycken Structuur<->Elementen exhibition on which this work is also visible. On pages 41 and 42 there are pictures of Piet 5 under the title Piet v.

Saturday, July 18, 2015

Havannah versus Hex

Havannah and Hex are both connection games, but slightly different because the first is a racing game and the other is not. Lets restrict the connection games to those games where players take turns in marking one position with their colour (in real play this is often done by placing a stone with thier colour on a location on the board) and where there is a collection of winning patterns that when marked by the same colour result in a win for the player who first marks the locations defined by the pattern. Futhermore, there are no restrictions on which locations can be marked at any point in the game. This to exclude games like Connect Four. The connection games can be divided into games where the winning patterns are the same both for both players or where they are complementary, in which case they are often symmetric in the sense that on the basis of some transformation rule there is a one-to-one mapping between the winning patterns for both colours. Usually there is a simple rule that describes all the winning patterns. (Because usually the first player has a significant advantage over the second player, often the pie rule is introduced, which allows the second player to switch colours after the first move, thus preventing the first player to make a move that would asure victory.) For all connection games it is theoretically possible to determine the optimal strategy leading either to a win or to a draw.

A connection game does not belong to the category of racing games, when every winning pattern for one of the players excludes all winning patterns for the other player. If this is the case for a connection game where the winning patterns are the same for both players, it means that all patterns must include more than half of a number of key locations. For this reason these kind of games must be kind of boring and will have a rather simple winning strategy for the first player. For this reason non racing connection games, usually will be like Hex, where the winning patterns are complementary.

Another important property of connection games is whether they are drawless. This is the case when it is not possible to mark all locations with either colour such that there is no winning pattern for either player. Hex is drawless and for Havannah not, although the number of markings without winning patterns is very small.

It is not the case that all non racing connection games are also drawless. One could think of a variant of Hex where a simple straight connection between two sides is not a winning pattern. Probably this variant is not very interesting because it is relatively easy to prevent the other player from winning. Games with a low number of draw positions are generally considered more interesting. I do not know whether it must be the case that all connection games with draws must also be racing games.

The winning patterns in racing games can often be divided into patterns that are tactical and patterns that are strategic. Tactical winning patterns are patterns that are easily prevented by the opposing player. They usually contain a low number of locations (such as the small cycle patterns in Havannah) or a limited set of key locations (such as the bridge patterns in Havannah). The presence of tactical winning patterns adds flavour to racing connection games, while they are probably not possible in non racing games.

I guess, I will start working on a formalisation of connection games, like I did for Havannah.


Wednesday, July 15, 2015

Carina Schüring

This evening, a good friend and I visited the workshop of Carina Schüring somewhere outside of Enschede. Despite some weather radar indicated that it might rain, we decided to go there by bike. We did not encounter any rain during our trip and also saw some sun. On the way back we made a small detour through the village Usselo.

Carina had beautifully arranged all her works of the past years on the wall of her workshop as kind of private exhibition for us. She had made us tea and served it with some biscuits. The window was open and you could hear the birds chirping. For her, it was also a long time ago that she had seen all her works together. We just enjoyed looking at her works in the calm atmosphere of her workshop and talking about various subjects. A very special evening for all three of use, as I understood. (On the top right a picture of a part of the wall.)

She already had thought about how much she wanted to ask for the work that impressed me so much during the 'AKI finals 2015' exhibition. For her the price is not so much determined by the dimensions of the work but the emotional value it has. The price was above what I initially had in mind, but now that I have met her and know what value she attached to it, I realize that it is a good price. I am seriously taking it into consideration.

Monday, July 13, 2015

'Volume' of icosahedron

In the past weeks, I thought about the 'volume' of the icosahedron. It has 12 vertices, 20 faces and 30 edges. For this we need to observe all the possible vertix colourings with the colours A, B, C, and D. Because all the faces are triangles, and have to be coloured with a different colour taken from α, β, and γ, it follows that each edge colour will be assigned to 10 edges. This means that the Kempe chains in the dual graph (a docecahedron) of each type (αβ, βγ, and αγ) will have a total length of 20. This could either be one chain of two chains, because the chains must be a multiple of 4 and larger than 5, only the combination of a chain with length 8 and a chain of length 12 is possible in case of the two chains. If for each type of Kempe chain it would be possible to have two chains, it would be possible to have 3.3.3 = 27 different points, meaning that each edge could theoretically be assigned a different point, because 12 is smaller than 27. It could be possible if this is the case for one of the types, because 3.2.2 = 12. However, if we try to colour the edges when there is a chain of length 8, it turns out that this is not possible. Furthermore, for each vertex colour there will be exactly 3 vertices with that colour. And all the vertices of the same colour will be assigned the same coordinate. A rather boring result. There are four types of faces with respect to the colours assigned to the vertices, and we can count for each type how often the edge colours appear clock or counter-clock wise. It seems that the 'volume' is equal to three tetrahedron between the four points, when adding and substracting the facse by orientation.

Wednesday, July 8, 2015

Magnolia more dead than alive

About a month ago, we placed the small magnolia tree in a bigger pot outside in the garden. Soon the leaves started to turn brown, probably because it was much colder outside than inside, especially because it has been rather cold in the past weeks, except for last week. Now two new leaves have appeared and a third is on the way. Only one of the new leaves is clearly visible in the picture on the right, and it has been partly consumed by some kind of insect (caterpillar). Although it looks more dead than alive, it looks like it will survive after all.

Friday, July 3, 2015

Tuesday, July 7, 2015


At 12:09:18, I bought the book Liefde is business by Arnon Grunberg from bookshop Broekhuis for € 4.95. Between pages 102 and 103, I found a beer felts from Chiangmai German Microbrewery & Restaurant. Possibly someone took this book to Thialand on holiday.


Sunday, June 28, 2015


Saturday, June 27, 2015

Books and AKI finals 2015

At 11:45:33, I bought the following two books from bookshop Broekhuis:
  • Both Flesh and Not, a collection of essays by David Foster Wallace, ISBN:9780241146095, for € 5.95.
  • De Nederlandse erotische literatuur in 80 en enige verhalen selected and collected by Elsbeth Etty, ISBN:9780241146095, for € 5.00.
In the afternoon, I visited the 'Finals AKI 2015' exhibition with a friend. We went to TETEM art space and next to the AKI ArtEZ building. Finally, we also went to the city center to have a look at Concordia art exhibition center, where a selection of the 'best' works were on display. I found the following artists interesting:

At 15:07, I bought Reproductie / Reproduction / Reproduktion, ISBN:9789075522365, the exhibition catalogue for € 15.00.

Thursday, June 25, 2015

'Volume' of planar graph

Given the followoing four collections of points:
    PA = { (2i, 2j, 2k) | i,j,k ∈ ℕ }
    PB = { (2i+1, 2j+1, 2k) | i,j,k ∈ ℕ }
    PC = { (2i, 2j+1, 2k+1) | i,j,k ∈ ℕ }
    PD = { (2i+1, 2j, 2k+1) | i,j,k ∈ ℕ }
And a given triangular planar graph (where each face is a triangle), the vertices can be mappeld on the union of these collection, such that each edge connects two points (from different collections) such that the distance between the points is equal to the root of 2. The implication is that each triangle face of the graph is mapped to equilateral triangle. It is relatively easy to calculate the volume of the resulting triangular mesh. For each triangular planar graph there is one (or more) mapping with a maximum volume. We could call this the 'volume' of a planar graph.

The proof that a mapping exists is as follows. For each triangular planar graph there exists a four colouring of the vertices with the colors A, B, C, and D. It is clear that one could assign each of the vertices with to the 'zero'-element of the collection matching the colour, where the 'zero'-element is the element with i, j, and k being zero. The edges can be labelled with α, β and γ depending on the colours of the edges they connect, such that edges between A and B and edges between C and D are labelled with α, that edges between A and C and edges between B and D are labelled with β, and that edges between A and D and edges between B and D are labelled with γ. In this case each triangle face will be labelled with α, β and γ exactly once. The Kempe chains αγ, αβ, and βγ in the dual graph partition the vertices for each type of Kempe chain. These partions can be assigned a natural number such that adjecent partitions differ exactly one. These numbers match with the three coordinates of the points. The case where the numbers are restricted to 0 and 1 is equavalent with the mapping to the zero-elements. But other mappings are possible resulting in a greater volume.

Sunday, June 21, 2015


July 2015
June 2015
May 2015
April 2015
March 2015
Alzheimer's Disease
Trip to China 2010
-- contact --



Kabuki Syndroom


Useless lists


My life as a hacker
Signature programs
Software enginering
The Art of Programming
eXtreme Programming


Hamilton cycles
cutting sticks
Califlower fractal


Volcano Blog


The email address below, may only be used for private communications. This email address may not be put on any mailing list. I do not want to receive emails with advertisements of any kind. My email address is:

Site statistics

If I did not count wrong, this site consists of 869 HTML-files with a total size of 18,441,895 characters, having 39395 internal links and 8192 external links. (About 679 of the external links are broken.) Furthermore, it contains 151 C/C++ program files with a total size of 3,412,360 characters, and 3 PASCAL program files with a total size of 35,259 characters. There are 55 text files with a total size of 351,644 characters. With respect to images, this site containts 1152 JPEG images (total size 49,744,910 bytes), 146 GIF images (total size 3,765,046 bytes), 82 PNG images (total size 2,029,477 bytes), and 2 BMP images (total size 3,727 bytes). With respect to sounds, it contains 14 WAV files with a total size of 389,002 bytes and 1 MP3 files with a total size of 70,182 bytes. It also contains 43 PostScript files (total size 308,387 bytes), 2 LaTeX files (total size 132,020 characters), 8 PDF files (total size 640,573 characters), 21 zip files (total size 2,275,072 bytes), 3 gzipped tar files (total size 52,345 bytes), 44 SGF files with a total size of 83,527 bytes, 90 KML files with a total size of 4,271,736 bytes, and 2 EXE files with a total size of 38,340 bytes. It also uses 16 JavaScript files with a total size of 911,144 bytes,


Creative Commons License

I, Frans hold the copyrights of this and all other pages on this website. For this website a Creative Commons License is applicable. You may not use this work for commercial purposes. I consider all computer programs to be copyrighted by me under the GNU General Public License, unless stated explicitly otherwise. All quotes (text and program fragments) from other sources are excluded from this, and should be considered as copyrighted by their authors.

An alternative link for this website is: http://5z8.info/back-to-africa_b2t1i_super-nsfw.

(This space is intentionially left empty)