I'm in. Efficient programs is my thingy Very Happy Very Happy
Just a question can I use assembly library's to my aid
Redston_1 wrote:
Just a question can I use assembly library's to my aid


No, I think this program is pure BASIC.
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).
jacobly wrote:
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).


This is the timer they will be using for the contest (according to womp). And I say you go with the second one, as its average time is faster.
RandomGuest wrote:
Redston_1 wrote:
Just a question can I use assembly library's to my aid


No, I think this program is pure BASIC.


Yes, you cannot use assembly, this is a 100% basic programming contest Smile
You don't even know how spicy these optimizations are getting down here.

PS: Jacobly, would you consider putting the following code at the end of your program? I feel like you are using hax.

Code:

{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}
For(A,1,1000
Rand
End
_iPhoenix_ wrote:
jacobly wrote:
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).


This is the timer they will be using for the contest (according to womp). And I say you go with the second one, as its average time is faster.


Haha, that timer won't work with at least three of our programs, possibly more. Razz
jacobly wrote:
_iPhoenix_ wrote:
jacobly wrote:
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).


This is the timer they will be using for the contest (according to womp). And I say you go with the second one, as its average time is faster.


Haha, that timer won't work with at least three of our programs, possibly more. Razz

Yeah, that's ok, PT_ said he had another way to accurately calculate the speeds, however, if they are all very far apart, then we won't need to calculate them accurately, because if you look at the beautiful vbs script, it only takes into account your rank relative to others, rather than your actual time.
mr womp womp wrote:
jacobly wrote:
_iPhoenix_ wrote:
jacobly wrote:
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).


This is the timer they will be using for the contest (according to womp). And I say you go with the second one, as its average time is faster.


Haha, that timer won't work with at least three of our programs, possibly more. Razz

Yeah, that's ok, PT_ said he had another way to accurately calculate the speeds, however, if they are all very far apart, then we won't need to calculate them accurately, because if you look at the beautiful vbs script, it only takes into account your rank relative to others, rather than your actual time.

I have a fast way: Film it in slow motion, and count frames. Tedious, yes, but accurate. Use the Timer program for an initial elimination, and if there are any close results, use the other method.
_iPhoenix_ wrote:
mr womp womp wrote:
jacobly wrote:
_iPhoenix_ wrote:
jacobly wrote:
I finally wrote a timer program and my current times on a TI-84 Plus CE in seconds on all the test cases in this thread are 1.9, 1.7, 6.3, 1.5, 0.2, 3.2 if I do it one way or 1.6, 1.7, 2.1. 1.7, 5.2, 0.7 if I do it another (both 80 bytes of code).


This is the timer they will be using for the contest (according to womp). And I say you go with the second one, as its average time is faster.


Haha, that timer won't work with at least three of our programs, possibly more. Razz

Yeah, that's ok, PT_ said he had another way to accurately calculate the speeds, however, if they are all very far apart, then we won't need to calculate them accurately, because if you look at the beautiful vbs script, it only takes into account your rank relative to others, rather than your actual time.

I have a fast way: Film it in slow motion, and count frames. Tedious, yes, but accurate. Use the Timer program for an initial elimination, and if there are any close results, use the other method.

hahaha, that's kind of ridiculous, there is a cc counter on CEmu Smile
MateoConLechuga wrote:
Please tell me we can at least use window variables.

It has been agreed upon that since it was not specified in the rules, and it is now far too late to modify the rules, window variables may be used. However, the calculator will be reset before testing your programs, therefore, those variables won't be initialized to 0 for you.
mr womp womp wrote:
hahaha, that's kind of ridiculous, there is a cc counter on CEmu Smile


I dont have CEmu though...
***Pieman7373 hides
Pieman7373 wrote:
mr womp womp wrote:
hahaha, that's kind of ridiculous, there is a cc counter on CEmu Smile


I dont have CEmu though...
***Pieman7373 hides


Then get it... It's not too hard.

***iPhoenix thinks, "Unless you are me..."
I assume that each program will be tested with several different input matrices as some programs would work better on some than others. How many tests will be performed, and if a program fails one maze but passes all others will it be disqualified entirely or will the slowest time for that particular maze be used?
We will all create 7 inputs, so in total 21, and every input should generate the right output, error=disqualify.
Each judge will test each program with 7 different matrices, and average the speeds from those tests,
so 21 tests total per program.
And it's Friday again (for me Wink), which means 1 of the 3 weeks is done, thus only 2 weeks left. Didn't you start yet? This is a great opportunity to improve your skills, learn how to overcome collaborations and battle with each other to create the best program! Friday next week we will post how we will exactly judge it, and how to submit the entries. Stay tuned and have fun! Smile
no guarantees, because my calc has been rather temperamental with random RAM resets (corrupted OS...) as of late - and I can't get DCSE on it at the moment - but I may participate!
M. I. Wright wrote:
no guarantees, because my calc has been rather temperamental with random RAM resets (corrupted OS...) as of late - and I can't get DCSE on it at the moment - but I may participate!

Good luck! There is just a little more than a week left! Very Happy Very Happy
Guys, it's Friday again! This means you have exactly 1 week to complete your program, fix eventually bugs, or start coding when you didn't already! As promised, I will tell you how we will grade it, and how you can submit your entry!

Grading:
We will start by checking if none of the forbidden tokens is in the program. If one of them is, or more, your entry will be disqualified. We will all create 7 inputs, independant, thus 21 inputs in total. Your program has to solve all these 21 inputs, without errors, and the right output. If it fails for at least 1 program, it will be disqualified as well. During the testing of all the inputs, we will keep track of the timing, by using the clock cycle counter in CEmu. We will get the time of each program the same way, to ensure everything went right. Your final timing is the average of all the 21 timings. The size of your entry, is the sum of all the sizes of your programs, minus the header(s). So, if you have prgmA which shows up as 420 bytes in the mem menu, your final size is 420-9-(program name length=1)=410 bytes. The same applies to subprograms. The last 10 points of your final score goes Elegance, which will be determined by the judge.

Submitting:
To submit your entry, put it in a zip file, and send it before 3/24/2017, at 23:59:59pm Eastern Time to contest at this domain. Please put your Cemetech username in the email body or topic, such that we know who we are grading Wink

Have fun, and good luck finishing it!
  
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 5 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