I just think that if you can not help other people, you shouldn't consider them as a joke... :sigh:

I need help from you who have experience with wumpus problem. I would like to ask that at one step, how can we choose the adjacent field to go ? I know one method that we choose the adjacent OK field (without mummies or pits) that has fewest visited times. My teacher said that it's not the most optimal method... Would you mind helping me. Thanks in advance.

Thax so much for your reply :D

I'm finding some documents about 3 layers model. Could you please share me some ? And please don't lead me to "Google" ;P

OK. Thanks so much for replying :D

Plz show me if that is the most optimal algorithm ? I really want to know the most optimal algorithm to solve this problem. So, would you mind helping me ?

I would like to check if a segment and a polygon have some intersections. Could you plz indicate me some algorithms to solve it. I knew Ray Casting algorithm and I wonder if there are other algorithms ?

I would like to check if a segment and a polygon have some intersections. Could you plz indicate me some algorithms to solve it. I knew Ray Casting algorithm and I wonder if there are other algorithms ?

Thanks for your replies :D

I think that the garbage collector deallocated the memory. How can we stop it plz ?

For example I have a struct like this : public unsafe struct V { unsafe public V* backpointer; }; When I declare : V n = new V(); n.backpointer = &x in a loop then the previous value of backpointer changed. Could you plz help me ?

modified on Sunday, October 5, 2008 9:50 PM

I have a pointer to a struct. In C++ I can allocate and deallocate it but in C#, I can't. Could you give me a solution plz !

I have a file whose content like this : 1 2 3 4 I wonder how can I read them to 4 variables a, b, c, d I tried using Read or ReadLine to read but there was no result Would you mind helping me ?