Magitek

"Follow that cab!" (times 5)

"Meet me under the lamp post at midnight." "Which one?" "You'll know.."

Rendilli, it would be easier to try and load in a shot of the traffic data map or the zones map than an actual screenshot of the roads. (Not sure if that's what you were trying to do or not.) DarkMatter, in a week I will have access to my AI textbook again. I can look through it a bit and see if there are any interesting pathfinding algorithms. Let us know what inputs and outputs a plugin needs to have when you get that part working.

---------------- On 5/21/2003 3:53:26 AM Rendili wrote: Magitek, i tried to go to your links but got the following error : Unable to determine IP address from host name for moogle.sandwich.net ---------------- Hmm, strange. It works for me. You could try going through my old site location: http://www.rose-hulman.edu/~sheridjs I wish I could help you guys more. I actually have the .NET visual studio on another computer, but I've never used it. Don't know much of anything about C#. I could try and write a plugin for the program if I ever get some time, but as I'm sure I've complained many a-time before, I don't really have time these days. I'll keep watching. If you want an algorithm looked at or code debugged you could try sending it my way. I may be able to help in that respect, but you guys are working on these things so fast that you'd leave me in the dust. Thumbs up to both of ya.

About my trains. They would take that path repeatedly. Not sure if that makes it more or less helpful. It was kinda random that I found this. I'll let you know if I see anything else odd. Interesting applet Rendili. As for why it's not finding the shortest path in a case like Proper_Bo's, I think it's just not looking far enough. It sees that there is water to the right and grass everywhere else, so it takes the southern path, because it's closer to the goal. Try putting the start at 3,3, for example, and the end at 10,10. Then put a road to the right from 5,3 to 10,3 to 10,8.. The path will go down and right on the grass because it can't see the road. (.. have you seen my java program Rendili? There's a link to it in my sig. I also have two java applets online. They're not too impressive though. )

Heya. I found something interesting today. Unfortunately I haven't had time to catch up on the Travel Time Testing thread. I'm still on the beginning of page 7 or so after some skimming. Anyway, one of the last things I read about, someone was asking people to look out for places where the algorithm might fall into a dead end. I believe I have found just a place! Ok, in this city, I was trying to separate blocks of zones by only rail. It's not workin' all that well, but that's another story. So, this city has two neighbors which both have road connections to this one. You can see this up in the upper left corner. I was trying to get these connections to hook up to the rail line instead of directly to my zones. I didn't want the people in the zones leaving directly by road. This means I've got at least a little bit of traffic using the rails. (The reason why the road in the corner isn't connected is because if it was, it would be blood red.) Heading toward the meat of my post.. The important parts of the upcoming scene are the station in the upper left, the station in the upper right, the rail connection in the lower right, and the various railways among said stations and connetion. http://moogle.sandwich.net/screenshots/sc4_lametrain.jpg This first shot shows a train happily passing the station in the upper left and driving off to the dead end. It came from the connection at the bottom. At this dead end, I noticed trains disappearing and reappearing traveling the other way. They did not stop at the station. Nobody is using it. They turned around and went to the station in the upper right. http://moogle.sandwich.net/screenshots/sc4_lametrain2.jpg I decided to put a loop at that dead end and see if it would swoop around and head back. Sure enough, it did. It should just take the diagonal rail. That'd be the most direct path.