_iPhoenix_ wrote:
There used to be this really amazing optimizer, but I guess they removed it.
My fault, I didn't know anybody used it, much less knew it was there. I've restored it for now and opened a tracking bug to integrate that feature set better with a tool that's actually known to exist on the site.
Tari wrote:
_iPhoenix_ wrote:
There used to be this really amazing optimizer, but I guess they removed it.
My fault, I didn't know anybody used it, much less knew it was there. I've restored it for now and opened a tracking bug to integrate that feature set better with a tool that's actually known to exist on the site.


It's fine! I used it once or twice, and it worked 80% of the time (That makes since)
Just for clarification, do we need to find a path or an optimal path?
jonbush wrote:
Just for clarification, do we need to find a path or an optimal path?

A path, although getting the optimal path can the fastest.
PT_ wrote:
jonbush wrote:
Just for clarification, do we need to find a path or an optimal path?

A path, although getting the optimal path can the fastest.


[brag]Not if you are using a REALLY good algorithm...[/brag]

EDIT:
I know the 'bbcode' tags don't work.
I'll enter. Let's see if I can still program in BASIC after so long. Smile

Also, I know ≤ and < aren't allowed, but what about >? Laughing
calcnerd_CEP_D wrote:
I'll enter. Let's see if I can still program in BASIC after so long. Smile

Also, I know ≤ and < aren't allowed, but what about >? 0x5


DON'T ASK! We need that token...
Eh... why not? But will having an 83+ affect my eligibility for this? Shock
Battlesquid wrote:
Eh... why not? But will having an 83+ affect my eligibility for this? Shock

No, although keep in mind that entries will be tested at a CE. Programs should be compatible though.
Battlesquid wrote:
Eh... why not? But will having an 83+ affect my eligibility for this? Shock

It shouldn't. I believe that most programs that you write on the 83+ will be usable on the CE, but I'm not sure.
I have a couple of questions:
1) Will there always be 1's around the borders of the maze except at the start and exit, or could the matrix be, say, all 0's?
2) Is this output legal (representing a path that visits a square, then doubles back)?

Code:
1111111111
2200000001
1200000001
1200000001
1220000001
1200000001
1200000001
1200000001
2200000001
1111111111
1) Yes, the borders will be filled except the start and end point.
2) No, the path should not cross itself, or visiting a square twice.
lirtosiast wrote:
I have a couple of questions:
1) Will there always be 1's around the borders of the maze except at the start and exit, or could the matrix be, say, all 0's?
2) Is this output legal (representing a path that visits a square, then doubles back)?

Code:
1111111111
2200000001
1200000001
1200000001
1220000001
1200000001
1200000001
1200000001
2200000001
1111111111


If it isn't, you could always switch the 2 back to a 0 if it has to backtrack.
I will be providing plaques for the winners, similar to those from the previous two contests.

jonbush wrote:
I will be providing plaques for the winners, similar to those from the previous two contests.



Aww crud. Now there will be REAL competition...

EDIT:
PT_ wrote:
1) Yes, the borders will be filled except the start and end point.
2) No, the path should not cross itself, or visiting a square twice.


What about dead ends? Should our algorithms take care of that? Or will there simply not be any? Or something else?
There are no dead ends, the startpoint is ALWAYS (2,1) and the endpoint ALWAYS (9,1).
Welp, the Asm84CEPrgm token isn't banned so I guess I'll do that Razz
Nope, we would disqualify ASM programs that are written in BASIC Razz
Will the path ever be maze-like at all? or will it just be a squiggly path?
I mean will there be any dead ends?
CalcMeister wrote:
Will the path ever be maze-like at all? or will it just be a squiggly path?
I mean will there be any dead ends?


PT_ wrote:
There are no dead ends, the startpoint is ALWAYS (2,1) and the endpoint ALWAYS (9,1).
  
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

» Go to Registration page
Page 2 of 6
» All times are GMT - 5 Hours
 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum

 

Advertisement