| bio | website | programming-perils.com |
|---|---|---|
| location | Atlanta, GA | |
| age | 29 | |
| visits | member for | 2 years, 8 months |
| seen | Feb 3 at 2:50 | |
| stats | profile views | 262 |
Software Engineer at Emcien
|
Jun 8 |
awarded | Constituent |
|
Jun 8 |
awarded | Caucus |
|
May 19 |
awarded | Nice Question |
|
Apr 30 |
awarded | Notable Question |
|
Feb 14 |
awarded | Popular Question |
|
Jan 31 |
awarded | Good Question |
|
Jan 5 |
comment |
How to use designs skills as an advantage when looking for a programmer job? The sole developer/designer for a small company with no peers to work with and learn from is where I am now and trying to get away from!! |
|
Jan 5 |
comment |
How to use designs skills as an advantage when looking for a programmer job? Flash was actually the gateway that led me from designing to programming. I don't think its as relevant today as it was when I was heavily into it though. That makes pretty good sense about project manager, never thought about that before. Thanks. |
|
Jan 4 |
asked | How to use designs skills as an advantage when looking for a programmer job? |
|
Dec 22 |
awarded | Good Answer |
|
Dec 15 |
awarded | Popular Question |
|
Dec 15 |
awarded | Good Question |
|
Dec 14 |
accepted | How can I find own replacement when the company wants someone far less experienced? |
|
Dec 14 |
awarded | Nice Question |
|
Dec 14 |
asked | How can I find own replacement when the company wants someone far less experienced? |
|
Dec 12 |
comment |
If your algorithm is correct, does it matter how long it took you to write it? Thanks for all your info. Also just to clarify, it looks like the classic Hanoi game always has 3 pegs and the discs are always in the same starting position and need to be moved to the same ending position. This particular challenge varies number of rods and starting & ending positions. |
|
Dec 12 |
accepted | If your algorithm is correct, does it matter how long it took you to write it? |
|
Dec 11 |
comment |
If your algorithm is correct, does it matter how long it took you to write it? Are you saying that I should go to school, or just get take a job where I will have a mentor? |
|
Dec 11 |
comment |
If your algorithm is correct, does it matter how long it took you to write it? I could make a recursive function that moves a piece into place, moves any blocking piece out of the way, then starts over with the next piece. Starting with the largest piece and working down to the last smallest piece. The "is it optimal" part comes from when you move a blocking piece. Depending on where you move it, it can create additional unnecessary steps. For example moving a 1 onto a 3 will then be blocking the 3 and need to be moved out of the way again when its time to move the 3. but depending on the current configuration this may not be avoidable. |
|
Dec 10 |
comment |
If your algorithm is correct, does it matter how long it took you to write it? @ThorbjørnRavnAndersen, I did not learn any programming in school. I am self taught, I learned on the job, by books, experimenting, etc. I was not familiar with the game (except for remembering a similar game being played in planet of the apes), I had to Google to even know it was called "Towers of Hanoi." I do understand recursion (at least I think I do) and I used it here. But simply solving the puzzle would have been much more easier for me, the harder part was "What pattern will yield the least amount of moves possible every time." |