MaxCoderz

Cool! What's interesting about the RHex is that it's a much simpler design (at least compared to BigDog and Petman), and yet it still has an amazing range of mobility. So that's where our tax dollars go...(after the greedy bankers have had their cut, of course). Poor thing, will it ever reach the bo...

The same company that did bigdog just released a video of their prototype bipedal robot. Astounding.

Well, that's good to hear! Here's a suggestion: there's a lot of minesweeper clones out there already, so maybe when you finish with yours, you could put your own twist on it. Who knows; it might turn out to be a hit! It would at least be a good exercise. Anyways, that's just something to think about.

My God! That video was incredible! I'm still picking my jaw up off the floor. I had no idea robotics has come that far. As incredible as that dog was, did anyone else find it's movement to be a bit creepy? All through that video, I was amazed and a little scared. Something about the way that robot m...

Hey, great job! It plays about the same as the standard Minesweeper on Windows, except sometimes the buttons were a little stubborn, especially if you click near the edge of a button. This could just be Java's fault, though. Still, it's great to see that you've brought this project to a successful c...

I have a few questions. What do the isEmpty() and isWrapper() methods of the MButton class do? I would guess that isWrapper() returns whether the button is adjacent to a mine, but I can't think what isEmpty() does. Also, where in your code are the buttons being revealed? You seem to only check if th...

Are you sure that you're using a queue? Aren't you really just using a linked list and accessing each item in the list directly? This is illegal with queues. You can only add elements to the rear of the queue and remove (and process) elements from the front. An element in the middle of the queue sho...

It's true that queues are one-dimensional, but try not to think of a queue as an array. Of course, queues can be implemented as arrays, but it's much easier to come up with a solution to any given problem if you think of your data structures as abstract entities, rather than specific Java constructs...

King Harold wrote:you're allowed to learn in your own time

100% agreed. When you graduate, your degree is just a nice piece of paper. Your portfolio is what really counts.

Perhaps Hirschberg will come to the rescue.

The Java garbage collector will only reclaim allocated data if there is no longer any reference to the data. For example: String s1 = new String("blah"); String s2 = new String("blah blah"); s1 = s2; After the third statement, both s1 and s2 are pointing to the "blah blah&qu...

I was thinking of travelling with a 2*2 array to find the edit distance between two strings and then create a "Cell" object for each cell and have a pointer to where the "Cell" object can travel back to recover the best string comparison. Could you elaborate on this a little mor...

For larger projects, you might want to look into makefiles. Makefiles allow you to easily compile only the source files that were altered since the last compilation, instead of recompiling all source files every time. I don't know if they're double-clickable, though

Glad to help. Actually, this has been a learning experience for me, as well. I've never worked with the Traveling Salesman Problem before, and before a couple days ago, I had never even heard of factoradic numbers (good call, King Harold). This has all been really interesting.

Good job, Wesley. I wouldn't mind taking a look at your code. How about I pm you my email address?