Browse by Tags

All Tags » Artificial Intelligence » Algorithms (RSS)
Tuesday, October 12, 2004 5:31 AM

A quick travelling salesman resources before I get some shut-eye in case anyone tries the Squirrels .NET application

Squirrels gathering nuts in turn comes out to one of the larger problems in computer science, that of the travelling salesman. We are looking for an optimal, or least moves route to complete some tour. Since the two problems are related, but aren't exactly...
Posted by Justin Rogers | with no comments
Filed under: , ,
Monday, October 11, 2004 11:26 PM

An old programming contest reborn: Programmer of the Month (1993-2000)

I don't recall very many of the programming contests I entered in the past decade, but it is possible I tried my hand a few times at previous incarnations of the POTM. If you hae the will to not use .NET then you can head over and try it out. http://dinsights...
Posted by Justin Rogers | with no comments
Filed under: , ,
Thursday, September 23, 2004 10:52 PM

Natural Language & AI: Dissecting the process of reading.

It has been a few years since I've seen the reports on how people read and more specifically how speed readers get so darn fast, but I recently got an email that demonstrated the concept rather well. Rather than explain the research study in plain words...
Posted by Justin Rogers | 3 comment(s)
Filed under: , ,
Tuesday, April 06, 2004 12:49 PM

Quick introduction to the Zobrist Hash with real examples

I'm covering this because I think .NET is a great programming language for games that might take advantage of the Zobrist Hash. Traditionally any move based game such as Tic-Tac-Toe, Checkers, or Chess can gain super performance increases by storing and...
Posted by Justin Rogers | 2 comment(s)
Filed under: , ,
Monday, March 29, 2004 1:02 AM

Terrarium: How do we punish creatures that take too much time?

Okay, so Darren Neimke thinks this deserves a blog entry and I think he is probably correct. The method for punishing creatures that take up too much time really isn't understood and the methods are actually somewhat complicated, so they deserve to be...
Posted by Justin Rogers | with no comments
Filed under: , , , ,
Thursday, March 25, 2004 12:44 AM

For every piece of data made available via a schema, thousands more abound...

Matt Wayward got me thinking with his blog article on the http://weblogs.asp.net/mattwar/archive/2004/03/24/95790.aspx current usage of schemas to validate incoming data and the possiblity that this validation comes at a high cost. What is the cost of...
Posted by Justin Rogers | with no comments
Filed under: , , ,
Wednesday, March 24, 2004 7:52 PM

Taking a closer look at the power provided in stack based finite-state machines.

Abstract: I've blogged before on the various types of finite-state machines you could possibly use in the Terrarium, but I didn't really go into any depth on how you might take advantage of them. So I'm going to take this opportunity to talk about stack...
Posted by Justin Rogers | 1 comment(s)
Filed under: , , , , ,
Thursday, March 04, 2004 7:52 PM

Terrarium: A path-finding dream/nightmare...

Path-finding in the Terrarium is a classic David versus Goliath problem. While the groundwork for enabling path-finding experimentation in 2D was always there, some of the implementation details tended to make it hard for people to try out new ideas....
Posted by Justin Rogers | with no comments
Filed under: , , ,
More Posts