I'm looking to see a simple demonstration of the A Star Algorithm in C#. Can any one direct me to some good information. I did download a project from this site that did the a *, but it was missing a file so I wasn't able to see how it was implemented.

Thanks,
J

: I'm looking to see a simple demonstration of the A Star Algorithm in C#. Can any one direct me to some good information. I did download a project from this site that did the a *, but it was missing a file so I wasn't able to see how it was implemented.
:
: Thanks,
: J
:
This is the algorithm for it:
1. See what's before, is it equall then procced.
2. Scan for what's after, if found, it's a match.

: I'm looking to see a simple demonstration of the A Star Algorithm in C#. Can any one direct me to some good information. I did download a project from this site that did the a *, but it was missing a file so I wasn't able to see how it was implemented.
:
: Thanks,
: J
:

I've used regular expression for that. Like this:

string pattern = "foo*.jpg";
string haystack = "foo_bar.jpg";
string regexPattern = pattern.Replace("*", "(.*?)");
Regex regex = new Regex(regexPattern);

if (regex.Matches(haystack))
{
    MessageBox.Show("Match found: " + haystack);
}