I have tried out Kyatric's great pathfinding algorithm, however it is proving a bit unsuitable for my purposes, for a variety of reasons.
I have decided to write a very basic 'pseudo' pathfinding code for my purposes.
The game is a top down based game, with enemies supposed to be seeking the player. The walls are a constant width and do not have any T or X intersections, just bends and straights.
This is what I am thinking.
1. Every tick: enemy move at angle towards player (so enemy does not have to turn, don't ask ;) )
2. If enemy hits wall, move along the wall until there is an oppurtunity to move directly towards the player. go to step 1.
I am not sure how to implement this within the program, any help? Also, if there is any way to determine which way the enemy will follow the wall in Step 2, that would be great. Perhaps using invisible collision objects?