Actually it seems the range of values [55296, 57343] are bad. (and 13 is still bad). And sorry, you must not of saw my reply before I took down my testing scenario. I will start a new discussion in a second.

character 13 is carriage return, and weird - I just ran my own test again and values past 128 work now... I wonder if that was fixed/changed. If so wow, that's good news for my projects...

Did you account for the characters that are not persistent in the string storage? I have commented about them elsewhere. If I remember correctly, the character with value 13 should be avoided, as well as the character with value 92 (when followed by any other character, so no problem when the last character of the String) Also I'm pretty sure the range of values valid for a character that was persistent was not more than 128 or so. You can do a simple test offline (specifically to test the first) like so: for (int i = 0; i < 300; i++) // chars have min value 0, and 300 is just an arbitrary max here { UserInfo userInfo = UserInfo.getMyInfo(); userInfo.setString(0, "" + (char)i); userInfo.store(); userInfo = UserInfo.getMyInfo(); if (userInfo.getString(0).charAt(0) != (char)i) System.out.println("Error with character with value " + i); }

Haha I'm not so sure it is a true story. But I think it is a common story told to learning programmers, with morale of the story I think was the need for planning

Through unconventional methods I'm guessing. If you take a look at some of GreenHouse's other scenarios, you will see some of them deface the website page

@shrucis1, looks like it must be pulling from the website somehow which case profile image data may have some indication that it is left default. Takes a while to get through the list of users, and is the screen suppose to flash sometimes?

I'm not sure what an ArrayList would do for a closed list, besides holding all the closed squares - which when determining if it contains something, would be a linear search. It's been a while since I looked at this project, but it seems the boolean is pretty straight forward when checking neighbors at a cell.

@RUMMAKER, also - I imagine the algorithm would really only slow things down as the paths turn out to be really long, with many long branches that were promising at getting you to the destination and ended up not contributing.