On Oct 16, 2012, at 6:59 PM, Kerim Aydin ke...@u.washington.edu wrote:
'person' hereafter refers to first-class persons only.
Boo :p
. A Working program is a BF
program solves the problem for the (possible unannounced)
*possibly. If you do announce the test cases, it would be a bit
On Tue, 16 Oct 2012, com...@gmail.com wrote:
. A Working program is a BF
program solves the problem for the (possible unannounced)
*possibly. If you do announce the test cases, it would be a bit weird for a
program that clearly worked only for the test cases to be considered
On 1/30/08, comex [EMAIL PROTECTED] wrote:
+[,.]
That doesn't work. This does:
,[.,]
--
Taral [EMAIL PROTECTED]
Please let me know if there's any further trouble I can give you.
-- Unknown
On 2/4/08, Ian Kelly [EMAIL PROTECTED] wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Clever. Much shorter than the variant floating around on the web that
uses a divmod strategy.
--
Taral [EMAIL PROTECTED]
Please let me know if
On 2/5/08, Kerim Aydin [EMAIL PROTECTED] wrote:
On Mon, 4 Feb 2008, Ian Kelly wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Are any folks still trying, or is it pretty much game over here? -Goethe
If so, it's in part due to my
root wrote:
On Feb 4, 2008 10:37 PM, Kerim Aydin [EMAIL PROTECTED] wrote:
On Mon, 4 Feb 2008, Ian Kelly wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Are any folks still trying, or is it pretty much game over here? -Goethe
I would
On Feb 4, 2008 10:37 PM, Kerim Aydin [EMAIL PROTECTED] wrote:
On Mon, 4 Feb 2008, Ian Kelly wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Are any folks still trying, or is it pretty much game over here? -Goethe
I would like to
On Tue, 5 Feb 2008, Ed Murphy wrote:
I would like to know as well. If I run another round, is anybody
going to challenge Goethe for the points, or should I just terminate
the contest?
I would have tried, but it wasn't a good week for me to try something
as time-consuming as BF. Anyone for
On 21:37 Mon 04 Feb , Kerim Aydin wrote:
On Mon, 4 Feb 2008, Ian Kelly wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Are any folks still trying, or is it pretty much game over here? -Goethe
I'm sorry; other projects have
On Mon, 4 Feb 2008, Ian Kelly wrote:
Results of Brainfuck Golf Hole #4: There was only one entry. I hereby
award 35 points to Goethe.
Are any folks still trying, or is it pretty much game over here? -Goethe
On Jan 29, 2008 7:53 PM, Benjamin Schultz [EMAIL PROTECTED] wrote:
I can do a *double* ROT-13 encoder. Does that count?
That would be an interesting contest. I'm sure I'd lose horribly with
my bloated 4-character solution.
On Wed, 30 Jan 2008, Geoffrey Spear wrote:
On Jan 29, 2008 7:53 PM, Benjamin Schultz [EMAIL PROTECTED] wrote:
I can do a *double* ROT-13 encoder. Does that count?
That would be an interesting contest. I'm sure I'd lose horribly with
my bloated 4-character solution.
But I'll bet that one
On 1/30/08, Kerim Aydin [EMAIL PROTECTED] wrote:
On Wed, 30 Jan 2008, Geoffrey Spear wrote:
On Jan 29, 2008 7:53 PM, Benjamin Schultz [EMAIL PROTECTED] wrote:
I can do a *double* ROT-13 encoder. Does that count?
That would be an interesting contest. I'm sure I'd lose horribly with
my
On Jan 29, 2008 11:35 AM, Kerim Aydin [EMAIL PROTECTED] wrote:
First, I assume we need to preserve case?
Yes. That's not too clear from the page, but it would be necessary to
make their examples come out right.
Second, that wikipedia page is a little contradictory. The image at the
top
On Mon, 28 Jan 2008, Ian Kelly wrote:
The task for Hole #4 is to write a ROT13 encoder. The program's
output should be identical to its input encoded in ROT13, as described
at http://en.wikipedia.org/wiki/ROT13 (*).
Another (niggly?) pair of questions.
First, I assume we need to preserve
Kerim Aydin wrote:
Second, that wikipedia page is a little contradictory. The image at the
top implies that numerical digits translate [1-5]/[6-0] in Rot13, but the
written spec (and some online translators) preserve digits or at least
don't mention them... which is right?
I've never seen
On Jan 29, 2008 1:35 PM, Kerim Aydin [EMAIL PROTECTED] wrote:
On Mon, 28 Jan 2008, Ian Kelly wrote:
The task for Hole #4 is to write a ROT13 encoder. The program's
output should be identical to its input encoded in ROT13, as described
at http://en.wikipedia.org/wiki/ROT13 (*).
Another
I can do a *double* ROT-13 encoder. Does that count?
-
Benjamin Schultz KE3OM
OscarMeyr
On Jan 28, 2008 4:30 PM, Ian Kelly [EMAIL PROTECTED] wrote:
There were no entries in Brainfuck Golf Hole #3. By popular request,
the next hole will be substantially simpler.
You know, although I failed to enter in hole #3 out of laziness, it
seems pretty hard. You'd have to implement your own
On Mon, 28 Jan 2008, Ian Kelly wrote:
The task for Hole #4 is to write a ROT13 encoder. The program's
output should be identical to its input encoded in ROT13, as described
at http://en.wikipedia.org/wiki/ROT13 (*).
This task was suggested by Goethe. E claims that e has not already
spent
On Jan 28, 2008 4:51 PM, Kerim Aydin [EMAIL PROTECTED] wrote:
Quick niggly question: Output sentence at a time (sentences terminated by \n)
then ending at EOF, single sentence (\n outputs and ends), all at once (\0
outputs and ends), or character at a time (kinda dull). Or don't care, go
for
Given the way the last task went (61 minutes late... arrgh!), you may want
to amend the contract to allow a time extension if less than N valid
entries are received (possibly with public hints/feedback...). Also, I
agree that a mix of these harder tasks with simple are good... for
the last
On Sun, 20 Jan 2008, Ian Kelly wrote:
Ideally, EOF should be indicated with -1 as in getchar(), but that's
not an option here, and 0x00 is the next best thing. Plus, it's what
egobfi8 uses to indicate EOF by default.
Actually, when the egobfi8 interpreter reads in a -1 through getchar,
it
On Jan 22, 2008 10:58 AM, Kerim Aydin [EMAIL PROTECTED] wrote:
On Sun, 20 Jan 2008, Ian Kelly wrote:
Ideally, EOF should be indicated with -1 as in getchar(), but that's
not an option here, and 0x00 is the next best thing. Plus, it's what
egobfi8 uses to indicate EOF by default.
On Sun, 20 Jan 2008, Ed Murphy wrote:
root wrote:
Entrant: Murphy
Validity: Invalid
Length: 1216
Reason: No matter what I enter, I always seem to get back
as the result.
Could someone double-check this? It passed my unit tests, at least,
which were something like
1 1+
On Sunday 20 January 2008 19:51:47 Ian Kelly wrote:
I think the mathematical tasks may be tiring to some, so I'm going to
try something else this time. The third task for Brainfuck Golf is to
implement Unix sort. The input is to be read as a sequence of ASCII
lines, each terminated with a
root wrote:
Entrant: Murphy
Validity: Invalid
Length: 1216
Reason: No matter what I enter, I always seem to get back
as the result.
Could someone double-check this? It passed my unit tests, at least,
which were something like
1 1+
10 1-
10 11*
110 11/
On Jan 20, 2008 9:51 PM, Ian Kelly [EMAIL PROTECTED] wrote:
I think the mathematical tasks may be tiring to some, so I'm going to
try something else this time. The third task for Brainfuck Golf is to
implement Unix sort. The input is to be read as a sequence of ASCII
lines, each terminated
On Jan 20, 2008 8:24 PM, Josiah Worcester [EMAIL PROTECTED] wrote:
What's tiring for me is the programs that are moderately complex.
Try something much, much simpler. . . This allows people's skills at tiny code
to truly shine.
(I'm reminded of a golf round I played in a chatroom to do an
On Jan 20, 2008 8:07 PM, Ed Murphy [EMAIL PROTECTED] wrote:
Could someone double-check this? It passed my unit tests, at least,
which were something like
1 1+
10 1-
10 11*
110 11/
I'll be happy to award you the points if I'm proven wrong. I would've
asked you about it first,
On Mon, 14 Jan 2008, Geoffrey Spear wrote:
I scored 6945, although I'm absolutely certain that if the deadline
wasn't today I could've significantly cut that down by the simplest of
optimization.
Well, I feel dumb too... I got 549, but misremembered the timezones and
dinked around without
I think this problem would've been a lot easier had I not decided to
make the actual brainfuck coding easier by writing a debugger for the
Mac, which involved remembering how to code in Objective C, learning
Apple's CoreData API that I'd never used before (which was entirely
unnecessary for this
Goethe wrote:
On Mon, 14 Jan 2008, Geoffrey Spear wrote:
I scored 6945, although I'm absolutely certain that if the deadline
wasn't today I could've significantly cut that down by the simplest of
optimization.
Well, I feel dumb too... I got 549, but misremembered the timezones and
dinked
On 1/9/08, Ian Kelly [EMAIL PROTECTED] wrote:
I'd like to make the scoring a bit more interesting in future
challenges. I intend, without two objections, to amend the Brainfuck
Golf contract to read as follows:
Can you post the difference between this and current?
--
Taral [EMAIL PROTECTED]
On Jan 9, 2008 8:28 PM, Taral [EMAIL PROTECTED] wrote:
Can you post the difference between this and current?
Briefly, it allows more contestants per task to score points by
meeting optional objectives, clarifies that only one entry per
contestant is ultimately considered in the scoring, and
On Dec 11, 2007 7:22 PM, Nick Vanderweit [EMAIL PROTECTED] wrote:
I join Brainfuck Golf.
This was not to the public forum, hence ineffective (this was before
R2178 was amended, but the contract requires announcement anyway).
-root
I also leave the Brainfuck Golf contest for the same reason. With
school starting back up, I'll doubtfully have time to complete the
contests.
avpx
On Jan 7, 2008 1:15 PM, Taral [EMAIL PROTECTED] wrote:
I leave the Brainfuck Golf contest. Sorry, not enough time.
--
Eris [EMAIL PROTECTED]
On Dec 10, 2007 11:21 AM, Ian Kelly [EMAIL PROTECTED] wrote:
I don't think there's any need to wait on contestification or my
intended amendment to go through, so let's get started.
We'll begin relatively simple: the first task for Brainfuck Golf is
to print out all the prime numbers (and
On Monday 17 December 2007, Ian Kelly wrote:
I remind the contestants of Brainfuck Golf that there are only 10
hours left to enter programs for this task. If you've got one, send
it in!
Uh oh... I can't say I'll be able to fix my program before then. Well, I
might. We'll see.
I still have very little clue how to work with this. I might be able to
throw something together during computer class, but otherwise, I probably
won't be sending anything in.
On Dec 17, 2007 7:38 AM, comex [EMAIL PROTECTED] wrote:
On Monday 17 December 2007, Ian Kelly wrote:
I remind the
On Dec 17, 2007 5:38 AM, comex [EMAIL PROTECTED] wrote:
Uh oh... I can't say I'll be able to fix my program before then. Well, I
might. We'll see.
Send it in anyway. Maybe you'll get lucky, and I'll change my mind
about the endianness issue.
-root
On Saturday 15 December 2007 12:23:05 Ian Kelly wrote:
I just reread R2136 and discovered that pikhq's attempt to make
Brainfuck Golf a contest with me as contestmaster was unsuccessful,
because the action must be performed by the contestmaster-to-be.
Because pikhq was trying to install
Ian Kelly wrote:
The task doesn't disallow it. If it's somehow helpful to do that, go for it.
The task specification doesn't explicitly disallow printing out non-primes
either. Would a program that prints all integers from 0 to 255 qualify?
-zefram
On Wed, 12 Dec 2007, Zefram wrote:
The task specification doesn't explicitly disallow printing out non-primes
either. Would a program that prints all integers from 0 to 255 qualify?
Actually it says (and only prime numbers). -G.
On Dec 11, 2007 6:18 PM, comex [EMAIL PROTECTED] wrote:
On Monday 10 December 2007, Ian Kelly wrote:
We'll begin relatively simple: the first task for Brainfuck Golf is
to print out all the prime numbers (and only the prime numbers) less
than 256, delimited by newlines, and then terminate.
Wooble wrote:
I didn't try to figure out how to actually go about computing primes;
how to do any sort of useful conditional statements was beyond me
(since submitting my program I read up a bit on brainfuck algorithms
and should probably be better equipped for the next task, but it would
have
On Dec 11, 2007 11:01 PM, Kerim Aydin [EMAIL PROTECTED] wrote:
However, can you clarify: the list of allowable printing methods permits
different bases as long as its consistent, but just printing out the ASCII
character for each number and referring to the lookup table (as someone
suggested)
On 12/12/07, Ian Kelly [EMAIL PROTECTED] wrote:
I explicitly enumerated the allowable printing methods, and base 256
wasn't one of them. Or at least that was my intention. I'll have to
be clearer next time.
What about little-endian binary?
On 12/11/07, Josiah Worcester [EMAIL PROTECTED] wrote:
I end the voting period.
Valid votes are:
SUPPORT
OBJECT
The decision made by Agora is APPROVE.
Don't you need more support than object?
--
Taral [EMAIL PROTECTED]
Please let me know if there's any further trouble I can give you.
On Dec 12, 2007 11:28 AM, Geoffrey Spear [EMAIL PROTECTED] wrote:
I came very close to writing a perl program that was going to figure
out for me the optimal steps to take to do things this way, which also
seemed a bit like cheating. Then I briefly toyed with the notion of
writing a Brainfuck
On Dec 12, 2007 11:36 AM, Ed Murphy [EMAIL PROTECTED] wrote:
Wooble wrote:
I didn't try to figure out how to actually go about computing primes;
how to do any sort of useful conditional statements was beyond me
(since submitting my program I read up a bit on brainfuck algorithms
and
On Dec 12, 2007 10:35 AM, comex [EMAIL PROTECTED] wrote:
On 12/12/07, Ian Kelly [EMAIL PROTECTED] wrote:
I explicitly enumerated the allowable printing methods, and base 256
wasn't one of them. Or at least that was my intention. I'll have to
be clearer next time.
What about little-endian
On Dec 12, 2007 11:30 AM, Taral [EMAIL PROTECTED] wrote:
On 12/11/07, Josiah Worcester [EMAIL PROTECTED] wrote:
I end the voting period.
Valid votes are:
SUPPORT
OBJECT
The decision made by Agora is APPROVE.
Don't you need more support than object?
The action was without 2
On 12/12/07, Ian Kelly [EMAIL PROTECTED] wrote:
The action was without 2 objections, not with Agoran consent.
And the original intent was stated as without 3 objections.
However, I think that was a list of ballot options rather than a
tally, so the resolution is probably ineffective anyway.
On Dec 12, 2007 3:40 PM, comex [EMAIL PROTECTED] wrote:
On Wednesday 12 December 2007, Ian Kelly wrote:
What about little-endian binary?
I would interpret binary to mean binary numeral system rather than
binary data encoding. I've never seen any version of Arabic
numerals that was
On Wednesday 12 December 2007, Ian Kelly wrote:
What about little-endian binary?
I would interpret binary to mean binary numeral system rather than
binary data encoding. I've never seen any version of Arabic
numerals that was little-endian.
-root
Not sure what you mean there, but I was
Ian Kelly wrote:
I've never seen any version of Arabic
numerals that was little-endian.
Actually Arabic numerals in their original form *were* little-endian.
Written right-to-left, like the rest of the Arabic script. When they
were adopted by Europeans, the same visual
On Dec 12, 2007 4:25 PM, Zefram [EMAIL PROTECTED] wrote:
Ian Kelly wrote:
I've never seen any version of Arabic
numerals that was little-endian.
Actually Arabic numerals in their original form *were* little-endian.
Written right-to-left, like the rest of the Arabic
On Wednesday 12 December 2007 11:30:05 Taral wrote:
On 12/11/07, Josiah Worcester [EMAIL PROTECTED] wrote:
I end the voting period.
Valid votes are:
SUPPORT
OBJECT
The decision made by Agora is APPROVE.
Don't you need more support than object?
--
Taral [EMAIL PROTECTED]
Please
On 12/12/07, Josiah Worcester [EMAIL PROTECTED] wrote:
Sorry; that's a result of my preferred method for publishing votes.
SUPPORT people who supported
OBJECt people who objected.
There were no votes, so it's approved. ;)
Way obscure, especially with the heading Valid votes are, which
sounds
On Wednesday 12 December 2007 21:52:37 Taral wrote:
On 12/12/07, Josiah Worcester [EMAIL PROTECTED] wrote:
Sorry; that's a result of my preferred method for publishing votes.
SUPPORT people who supported
OBJECt people who objected.
There were no votes, so it's approved. ;)
Way obscure,
On Dec 11, 2007 9:47 AM, Geoffrey Spear [EMAIL PROTECTED] wrote:
Do you have a preferred newline format? Is the ASCII LF character
sufficient rather than a CR LF?
I prefer just LF, but I intentionally left it vague because it doesn't
matter much to me.
-root
On Monday 10 December 2007, Ian Kelly wrote:
We'll begin relatively simple: the first task for Brainfuck Golf is
to print out all the prime numbers (and only the prime numbers) less
than 256, delimited by newlines, and then terminate.
So, I'm a brainfuck newbie. I've made a program to store
comex wrote:
Thoughts? Can I hear some other peoples' character counts?
I don't want to give away competetive details, but I'll give some
approximate information. The first working version of my code to generate
and print the primes was about 350 characters. That was roughly half
for
On Dec 11, 2007 4:18 PM, comex [EMAIL PROTECTED] wrote:
So, I'm a brainfuck newbie. I've made a program to store the primes in
memory (not print them) that is 267 valid characters long. But I wouldn't
be surprised if someone else has made a much shorter implementation; and I
bet formatting
Ugh. You guys sound so far along. I'm a comlete newb and still am wondering
how I am going to do this.
On Dec 11, 2007 7:30 PM, Ian Kelly [EMAIL PROTECTED] wrote:
On Dec 11, 2007 4:18 PM, comex [EMAIL PROTECTED] wrote:
So, I'm a brainfuck newbie. I've made a program to store the primes in
I join Brainfuck Golf.
On Dec 10, 2007 6:25 AM, Iammars [EMAIL PROTECTED] wrote:
I join Brainfuck Golf
On Dec 9, 2007 4:41 PM, Zefram [EMAIL PROTECTED] wrote:
I join Brainfuck Golf.
-zefram
--
-Iammars
www.jmcteague.com
On Monday 10 December 2007, Ian Kelly wrote:
We'll begin relatively simple: the first task for Brainfuck Golf is
to print out all the prime numbers (and only the prime numbers) less
than 256, delimited by newlines, and then terminate.
Am I allowed to print out a prime more than once?
On Dec 11, 2007 7:52 PM, comex [EMAIL PROTECTED] wrote:
On Monday 10 December 2007, Ian Kelly wrote:
We'll begin relatively simple: the first task for Brainfuck Golf is
to print out all the prime numbers (and only the prime numbers) less
than 256, delimited by newlines, and then terminate.
On Tue, 11 Dec 2007, Ian Kelly wrote:
The task doesn't disallow it. If it's somehow helpful to do that, go for it.
However, can you clarify: the list of allowable printing methods permits
different bases as long as its consistent, but just printing out the ASCII
character for each number and
On Friday 07 December 2007 18:55:38 comex wrote:
On Dec 7, 2007 8:31 PM, Josiah Worcester [EMAIL PROTECTED] wrote:
I create the following contract.
Stop overcomplicating things :(
3) If a player would be awarded points by this contest, the player shall
be
awarded a Brainfuck Point.
On Dec 7, 2007 8:31 PM, Josiah Worcester [EMAIL PROTECTED] wrote:
I create the following contract.
Stop overcomplicating things :(
3) If a player would be awarded points by this contest, the player shall be
awarded a Brainfuck Point.
A Brainfuck Point is a fixed asset. A Brainfuck Point is a
On 12/1/07, Josiah Worcester [EMAIL PROTECTED] wrote:
1) Every week, the contestmaster shall announce a new task to be implemented
in Brainfuck.
With finite or infinite tape? With Z cells, Z_n cells, or just bounded
Z cells (that go undefined on overflow)? What's the bound?
--
Taral [EMAIL
On Saturday 01 December 2007 16:26:43 Taral wrote:
On 12/1/07, Josiah Worcester [EMAIL PROTECTED] wrote:
1) Every week, the contestmaster shall announce a new task to be
implemented
in Brainfuck.
With finite or infinite tape? With Z cells, Z_n cells, or just bounded
Z cells (that go
On Dec 1, 2007 4:30 PM, Josiah Worcester [EMAIL PROTECTED] wrote:
30,000 cells, 8-bit wrapping.
Wrapping array? Behavior on read at EOF?
Alternatively, maybe somebody should just provide a reference implementation.
-root
On Saturday 01 December 2007 16:11:40 Ian Kelly wrote:
On Dec 1, 2007 3:57 PM, Josiah Worcester [EMAIL PROTECTED] wrote:
I intend, without two objections, to create the following contract for the
purposes of a contest. I intend, if e consents, to have root as the
contestmaster.
I'm not
76 matches
Mail list logo
