Stukafest is a Dutch cultural festival by and for students. The idea really neat: you get to pick three out of about fifteen shows, each of which takes place in some student’s room. A bicycle is really convenient here, because you’re travelling from one side of the city to the other.
My first stop was the show from the performers of Sambacaxi, playing their drums in the dark of the evening on Domplein.
My favourite show of the evening: the Flemish Tom Bibo, performing in Boukje’s room near Wilhelminapark. He was clever, quick and had some very neat and impressive tricks. Always good to see a good magician at work.
Next was the Dutch band Primer, playing in Thijs’ room in the Ina Boudier Bakker complex. The music was nice, but the room was so dark it was hard to take good pictures, and it was very crowded, too.
United-C was a small play from two girls with shaving cream and lipstick. I especially liked the part where they sat on the couch with their backs to us, looking at us through round mirrors which they held above them while they moved them in round motions, making it so their reflections appeared to be “swimming”.
Finally, the evening ended with a party in Ekko, with lots of beer and crazy glasses.
All in all, a very nice evening!
Hello. I am a university student in Hong Kong. And I’m very interested in your Quoridor project since I am also working on artificial intelligence in Quoridor. So, would you mind answering me a few simple questions?
First, is it possible for you to tell me the algorithm you used in GoalSeeking? For sharing, my project do GoalSeeking by a theory called “Hill-climbing”, but it really takes too much time in every goal seeking.
Second, in SmartBrain1, would you mind telling me that if the response is mainly produced by Minimax decision making algorithm or is there any algorithm involved? I observed that the decision making in SmartBrain1 is very fast, which seems not to be using Minimax or negamax.
Are you aware that Martijn’s Quoridor implementation can be downloaded via ‘Projects’, above? (Martijn: it doesn’t do anything but show a white canvas with Java-1.6.0_03-p4 on OpenBSD-amd64, although it doesn’t pretend to work in that case.)
I would recommend reconsidering your choice of hill-climbing as the main algorithm, though. The utility of placing a wall – which is the main computation required of a Quoridor AI – is very irregular as a function of its location.
Martijn can tell you the details if he wants – they are not mine to tell – but I can tell you that his implementation doesn’t use hill-climbing.
Also, I have personally been unable to devise a faster algorithm than A* for the numerous pathfinding steps required (since placing a wall “changes little,” you could try to re-use results; but the extra bookkeeping more than cancels the reduced computation.)
Finally, this really isn’t an appropriate place for your question. Martijn, if you delete it, can you please delete this one as well?
Leave a comment!
Martijn loves to receive comments! Add yours by filling out the fields below.