This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - JWinslow23
Pages: 1 2 3 [4] 5 6 ... 40
46
« on: June 11, 2015, 01:55:54 pm »
And when I did it, headers didn't count.
What?
TI-BASIC and Axe? Name and program header didn't count. EDIT: As a heads-up, my incoming challenge has to do with Keith numbers. Let's hope everyone knows how to do Fibonacci-like sequences.
47
« on: June 11, 2015, 01:54:40 pm »
If somebody wants to post about new, better solutions or whatever here, I say let them. Any improvement to anything here is welcomed. I just hope lirtosiast enters this next contest
48
« on: June 10, 2015, 08:34:37 pm »
If somehow not available, this may be used instead, but use the byte count, not character count.
@Juju 's Counter counts in bytes AFIK.
The size of the program header for TI-BASIC entries should not be added to the scored size. Source means "length of code", not "file size stored in memory"; most languages have a header hundreds of bytes long on their files, and yet we don't count it. This gives an unfair advantage to non-calculator entries, whose headers are ignored.
I propose that TI-BASIC entries are counted as the size of the program in the [2nd][MEM] menu, minus the length of the name, minus nine bytes.
True, i agree that headers should not count, including headers for shells like Doors and Mirage.
Yes, but if you don't want to use it for some reason, I have used that as an alternative. And when I did it, headers didn't count.
49
« on: June 08, 2015, 10:36:29 am »
All in favor of making Juju's counter the official counter for all non-calculator languages, say "aye." All in favor of counting assembly as binary size, say "aye aye." All in favor of counting TI-Basic and Axe as on-calc source size, say "aye aye aye." All in favor of counting The Challenge Creator choosing the counting method, say "aye aye aye aye." (all on separate lines of course)
My response: aye. aye aye. aye aye aye.
Aye declare that tool as an official byte counter. If somehow not available, this may be used instead, but use the byte count, not character count. As pre-compilation hex files have a h- aye s- aye-ze, my opinion is that the final binary should be sized. T- aye BASIC as source s- aye-ze, Axe as comp- aye-led program. Of course, aye can't dec- aye-de the last one m- aye-self. I'm a bit b- aye-ased.
50
« on: June 08, 2015, 10:26:47 am »
To keep the OP uncluttered, no, but PM me and I'll give you the requested solution.
Actually, what I did was put the code in a table, with [ spoiler ] tags with the code inside. For example, taken at random from a pre existing contest: JavaRank | User | Size | Date | Code | 1 | 3298 | 189 | 8/29/2014 12:16:14 PM | | 2 | pimathbrainiac | 268 | 8/25/2014 6:57:57 PM | |
Maybe you should do that.
51
« on: June 07, 2015, 12:33:15 pm »
As a heads-up, guys, today is the last day of the challenge. Make it count!
52
« on: June 03, 2015, 10:15:07 am »
I have to say, the results are very good so far. All of these but 2 are sub-100. I'm proud of the coders.
53
« on: June 02, 2015, 06:12:49 pm »
Bump.
Even newer code. Now, no divide program. Also a bit faster.
Download links attached, here is the code to type in:
PICALC.8xpSetUpEditor Q,T,R {1->|LQ {60->|LT 3Ans->|LR ClrHome Output(7,1,"CLEAR TO EXIT. # NEXT: 0... "?->Str1 2->I% Repeat getKey=45 If 1<length(Str1 Then " If not(fPart((length(Str1)-2)/16 Output(6,1,Ans+Ans+Ans+Ans 2+16int((length(Str1)-82)/16)(98<=length(Str1 Output(1,1,sub(Str1,Ans,length(Str1)+1-Ans End Output(8,2,I%-2 Output(8,12,0 5|LT->L1 prgmAADJUST L1->L2 (9I%-4)|LQ->L1 prgmAADJUST 3L1+5|LR->L1 prgmAADJUST 0->PV prgmACOMPARE While Ans>=0 PV+1->PV Output(8,12,PV L1-L2->L1 prgmAADJUST prgmACOMPARE End sub("0123456789",PV+1,1 If I%=2 Ans+". Str1+Ans->Str1 (5I%-2)|LQ+|LR-PV|LT->L1 prgmAADJUST 30L1->L1 prgmAADJUST If I%<33 Then 9I%^^2+9I%+2 Else (3I%+1)L1->L1 prgmAADJUST 3I%+2 End AnsL1->L1 prgmAADJUST L1->|LR 10I%|LQ->L1 prgmAADJUST (2I%-1)L1->L1 prgmAADJUST L1->|LQ 3|LT->L1 prgmAADJUST If I%<33 Then 9I%^^2+9I%+2 Else (3I%+1)L1->L1 prgmAADJUST 3I%+2 End AnsL1->L1 prgmAADJUST L1->|LT I%+1->I% End ClrHome sub(Str1,2,length(Str1)-1->Str1 Disp "# OF DIGITS:","DIGITS STORED IN","Str1 Output(1,14,I%-2 AADJUST.8xpIf min(L1)>0 and |E10>=max(L1 Return 0->PMT For([recursiven],1,dim(L1 PMT+L1([recursiven]->|N int(|N|E~10->PMT |N-PMT|E10->L1([recursiven] End If not(PMT Return [recursiven]->dim(L2 Ans->dim(|LQ Ans->dim(|LR Ans->dim(|LT PMT->L1(Ans ACOMPARE.8xp1+dim(L1->|N Repeat Ans or |N=1 |N-1->|N L1(|N)-L2(|N End
54
« on: June 01, 2015, 06:03:45 pm »
55
« on: May 29, 2015, 09:02:50 pm »
Isn't the grid required to be 4x3, as per contest rules? It looks nicer this way, but I'm not sure the judges would count it.
They said 3x3, 3x4, or 4x3. Also, woohoo! Contest is almost over! Expect a release soon (but after the deadline )
56
« on: May 29, 2015, 05:20:30 pm »
Hey @JWinslow23 Would you mind if this were picked up again by some other people (such as c4ooo, Sorunome, and myself)?
Oh. Hehe. I almost forgot I did this. And that people were still interested. :\ But yeah. Of course you can revive it. I'd actually like it to be revived, sans all the bad entry ideas I had and overflows of PMs in my inbox . ...one thing though. If you do revive it, tell me where it is...and put some bad puns in there!
57
« on: May 13, 2015, 08:05:33 pm »
Bump. I made the grid bigger, and implemented difficulty settings (in the form of different pipe forms) (bet you can't guess the formulas I do to figure them out )! Download link attached to the original post will become available when it faces judgement from the original walrus. :walrii:
58
« on: May 12, 2015, 01:17:46 pm »
Good choice for the contest! *If you squint your eyes you can see the bird flap!
Lol AsmBandit . Haven't seen you in a while, and looking forward to that Code Zombie game. And thanks! This was literally the first thing that popped into my head that I could manifest into a monochrome 4x3 box of pixels. But it worked surprisingly well.
59
« on: May 12, 2015, 12:04:24 pm »
Looks nice! But be aware that the larger percentage of the screen you use, the more points you get.
That's the greatest area I can use in TI-BASIC without it being so uncomfortably slow I might make it into Axe, but if I can't in time, I'll submit this.
60
« on: May 12, 2015, 10:59:01 am »
Have you ever thought Flappy Bird was too easy? Are you easily able to get a score of at least 5 every time you play? Have you been playing so much that you sold all your possessions for some reason in order to keep playing it? Well, now there's hope Introducing: Bitty Bird! Bitty Bird packs all the fun and frustration of Flappy Bird into the barest resemblance of a game you can make it into . It's also written entirely in TI-BASIC, so the minimalist aspect really shines there . Press UP to flap your less-than-a-subpixel-long wings, and get through as many of the definitely-metallic-and-green pipes as you can before you crash! At the end, it shows you your score as individual letters and digits (i.e. a score of 14 would be S C O R E 1 4 flashing on the screen). You can press CLEAR to quit at any time. It has two programs, BTTYBIRD and BTTYDRAW. Both are needed, and you run the game by running BTTYBIRD. You can download them right below, as attachments to this post after the contest, otherwise I'm disqualified . Planned features: Cramming the game in 2x2 pixelsColoration of the bird, sky, and pipesPhysics so realistic your eyes hurtinsert funny joke here- Difficulty settings
Please give me feedback! Thanks in advance! :lobstah: P.S. In case you were wondering, my high score is 22. I wonder if the judge can do better...
Pages: 1 2 3 [4] 5 6 ... 40
|