![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
It's so hard to remember my life
Nov. 30th, 2005 01:24 pmI know I've not been reporting on much except work recently, but really that's about all my life will consist of in the near future. The interim report for the project is due in on Monday, where I'll have to report that my program can now solve games with about 40 cards in them, but still takes upwards of eight hundred moves to do it. I have a fair idea of how to make it a bit less appallingly stupid, but that involves a meeting with my project supervisor, and finding him is proving to be a problem.
In the meantime I've been trying to get some of the practicals out the way - in Multimedia we've been given the task of modifying videos in groups, and I thought a decent idea would be to get hold of some political broadcast (a Liberal Democrat one, perhaps) and add a laugh track to it. We'll either do that or a music video. Thankfully it's the last piece of groupwork we'll have to do this semester - in half an hour we're having the first meeting about the last presentation of the year, which was given out about two months ago and is due to be presented on Tuesday.
After that there will just be the solo practicals to clear up. I'm getting one done just now, and have just come up with this gem of a paragraph in response to "How do the expansions involved in an A* search relate to the complexity predictions?":
"To avoid an exponential growth in A*, |h(n) – h*(n)| must be below or equal to O(log h*(n)), where h(n) is the estimated cost of getting from n to the goal and h*(n) is the true cost. Therefore, the error in the estimation of cost must be of order of the logarithm of the true cost. With a problem that involves only low distances and depth of states it is difficult to determine whether this condition has been satisfied or not – however, it can be seen from the reported results that the A* search explores many more routes than the single path given by the Greedy search, and therefore increases optimality at the cost of also increasing the space complexity."
I think that's the best way of saying "I have no idea how to answer this question" that I've ever invented.
In the meantime I've been trying to get some of the practicals out the way - in Multimedia we've been given the task of modifying videos in groups, and I thought a decent idea would be to get hold of some political broadcast (a Liberal Democrat one, perhaps) and add a laugh track to it. We'll either do that or a music video. Thankfully it's the last piece of groupwork we'll have to do this semester - in half an hour we're having the first meeting about the last presentation of the year, which was given out about two months ago and is due to be presented on Tuesday.
After that there will just be the solo practicals to clear up. I'm getting one done just now, and have just come up with this gem of a paragraph in response to "How do the expansions involved in an A* search relate to the complexity predictions?":
"To avoid an exponential growth in A*, |h(n) – h*(n)| must be below or equal to O(log h*(n)), where h(n) is the estimated cost of getting from n to the goal and h*(n) is the true cost. Therefore, the error in the estimation of cost must be of order of the logarithm of the true cost. With a problem that involves only low distances and depth of states it is difficult to determine whether this condition has been satisfied or not – however, it can be seen from the reported results that the A* search explores many more routes than the single path given by the Greedy search, and therefore increases optimality at the cost of also increasing the space complexity."
I think that's the best way of saying "I have no idea how to answer this question" that I've ever invented.
