« first day (1988 days earlier)      last day (2849 days later) » 

6:03 AM
Woah. Evolve went F2P.
 
anyone know how to do a paragraph break in LaTeX?
 
two back slashes
is what I'm trying to say
 
@Downgoat What do you mean by a paragraph break?
a space between two paragraphs?
 
paragraph break is usually new newlines
\\\\ doesn't work
 
\smallskip \medskip or \bigskip
 
6:14 AM
\par?
 
>_> I tried to type "valid variable" but I typed "valirable"
@Fatalize nope, doesn't work with KaTeX >_> I'm trying to do this for Cheddar docs
 
the hell is KaTeX
 
there's already a billion different compilers and they make new ones
@Downgoat \vspace[0.5em]
 
A quick Google search brought this up if none of the above works: sharelatex.com/learn/Paragraphs_and_new_lines
 
6:16 AM
change the value to your need
 
@Fatalize ;-; that's not supported either
 
lmao
 
@GamrCorps that doesn't look like it's for math mode tho
 
start a new paragraph and only write ~ in it
 
Oh a paragraph break in math mode... that is more difficult...
 
6:18 AM
@GamrCorps yeah :/
 
wait you're talking about math mode
 
yeah
 
just put everything in a \begin{align}\end{align} and you can break lines with \\
 
> once
 
not sure it's supported though
 
6:19 AM
@Fatalize already have that >_> still the same
 
^^^^
what about a normal paragraph break outside of math mode? Like: \[\] \par \[\]
 
@GamrCorps can't KaTeX is only math mode
 
Huh. Well, I'm out of ideas.
 
@Downgoat \begin{aligned} is supported apparently
then you can break with \\
and align the lines with &
 
@Downgoat Yes. Precisely one time. No more beyond that. :)
 
6:22 AM
@Fatalize yeah, but that only inserts one line break. I try to do \\\\ and it doesn't work :(
 
now I just sit near a window.
 
@DrGreenEggsandIronMan but Iron Man has went outside at least 3 times as they are 3 movies
 
@Downgoat \begin{aligned}
equation \\
~\\
Equation 2
\end{aligned}
 
All I could find on Google was this: github.com/Khan/KaTeX/issues/171 which isn't very helpful...
 
@Fatalize that did it, thanks :)
 
6:24 AM
@Downgoat Dammit, that's true. Maybe I'll just have to become DR Seuss instead of Iron Man.
 
@Downgoat ~ is unbreakable space
 
huh ok TIL
@DrGreenEggsandIronMan go back to DJ McGoathem pls :3 :3 :3 its best name 10/10
 
Or I could be Green Eggs and Goat meat.
 
...
._.
O_O
;_;
ಠ_ಠ
@DrGreenEggsandIronMan so many emotions at once. Y u do dis
brb ignoring you
 
Disbelief --> Emptiness --> Shock --> Sorrow --> Anger
 
6:27 AM
wait no that's not the right order of 5 stages of grief
 
No, that's what your five emojiis were in order.
Also, sorta relevant xkcd:
 
6:43 AM
@Fatalize nope doesn't support it ;_;
 
6:55 AM
________
|;_____;|
 
7:19 AM
@Downgoat you said it did it...
 
@DestructibleWatermelon I love your profile pic. :D
 
thank you
I'm nearly going to post my sandbox post for a KotH challenge
 
@Downgoat And it says in the wiki that aligned is supported...
 
7:57 AM
I posted my idea in the sandbox now
 
0
A: Sandbox for Proposed Challenges

Destructible WatermelonKotH Chess Warriors. This game will be based on fairy chess, but really could be imagined to be anything else. Submissions will include both: A function that determines the moves of the piece (as in, how the piece can move), called at the start, and a function that determines how it moves each ...

 
8:24 AM
hi all
 
user214599
:)
 
user214599
oh.
 
8:39 AM
hello
 
8:57 AM
hi
 
g00d morning
 
Hi @TùxCräftîñg, remember that mario challenge you made? I have ideas to make it better
 
@DestructibleWatermelon what ideas ?
 
well, to clarify how exactly Mario can move.
 
9:10 AM
Let's say that mario can ONLY walk right
 
When mario jumps, he only goes one right
This could possibly make it more clear, and perhaps easier to implement
there would still be some challenges in implementing. For example: There is a flat ground for start, a big platform above, and the end below the platform. the program would have to make sure it checks both, and not just the top of the platform.
I think that could make for a good challenge
all the examples you made already follow the rules for what i have stated
could i try making an edit?
 
@DestructibleWatermelon i have already edited, but if you can clarify more, edit it
 
kk, I will start working on it
I would say that it seems like you have a pretty good challenge idea there, either way
 
Ohh fibonacci time!
 
9:35 AM
tux crafting, it seems as though Mario can only jump 4 high
@TùxCräftîñg
 
Ok, should I make it so he can jump 5, or only 4?
 
he can only jump 4
 
the source code of Apollo 11 AGC is in public domain :D
 
9:40 AM
I think that I might have a good edit almost done, but I'm not sure
 
@DestructibleWatermelon if you submit the edit, I'll have a look
 
kk
I'm not entirely sure my edit is going to make it good enough, but maybe it will be a step in the right direction
@MartinEnder submitted
 
@DestructibleWatermelon the edit clarifies most things but it made the challenge substantially more difficult. was that your intention?
 
how so was it more difficult?
 
in the original challenge the = formed a single connected path that could never go left
 
9:53 AM
oh
well then.
 
if you allow arbitrary positioning of =, S and E that turns it into a pretty tricky path-finding problem
 
well then
I will correct it
 
@TùxCräftîñg what's your opinion on the edit?
 
it's a good edit
 
I maybe should have looked a bit better, should I correct it?
 
9:56 AM
@DestructibleWatermelon I mean if TuxCrafting doesn't mind, then it's a fine challenge now. Just quite different from the original.
in its current form it definitely needs more test cases though.
 
ok then
My opinion on how it would be solved currently though is this:
for each position, make a list of all possible next positions
follow the first option
 
basicly pathfinding
 
do that until a dead end it met, then evaluate all the options in the furthest branch. If the entire branch is a dead end, step back evaluate the other options, repeat
when all options are exhausted, output false, if you find it, output true
 
yeah, that's basic pathfinding. the original challenge could be solved much more easily (in a greedy manner)
 
in the original challenge, all you would have to do is check if Mario can make the next jump. In this one, you have to check if Mario SHOULD make the jump
 
10:02 AM
yes, and in the current one, mario has to walk left potentially (which isn't currently covered by the test cases though)
 
this version is more interesting that the first
but also more complex
 
actually, I stated that mario cannot move back/left
 
@TùxCräftîñg I'm not so sure about that. we already have quite a lot of challenges that require basic pathfinding on a grid. the main difference is which cells can be reached from the current one.
the basic one seems like the more unique challenge.
 
Well, I could adjust it to the proper form.
also, is the second to last example a valid input?
 
10:03 AM
that said, I don't see any problem with posting both versions
(although in that case I'd make the pathfinding one as general as possible by allowing mario to move left as well)
 
I will review my edit
Well, actually, a lot of my edit was based on the fact i didn't realise it was a continuous path
I think that this may be a fun challenge, when done
 
#define IF(c, g) if (c) goto g
#define ELSE(g) else goto g

#include <stdio.h>

int main() {
    int i = 10;
    w0start:
    IF(!i, w0end);
    printf("%d\n", i--);
    IF(i, w0start);
    w0end:
    return 0;
}
._.
 
@TùxCräftîñg I need clarification though. is the second to last example valid
 
10:18 AM
this ?

---------
 =
 =   E
S=   =
==   =
 =   =
 =====
---------
 
yes it's valid
 
is it valid?
ok then
Um, is it valid if the top part goes backwards
I think it's not, but just to be sure
 
no, it's not valid
 
ok, good
---------
 =
 =   E
S=   =
==   ==
 =   =
 =====
---------
is that valid
yes it should be
 
10:23 AM
yes
 
let me try another example
---------
 =
 =   E
S=   ===
==   =
 =   ==
 =====
---------
is it valid
 
if we visualise this as a line that goes in one direction, it would have to go left
/back
 
i think you should create your own challenge based on this
 
to be honest, it's a little bit unclear what the limits are for valid and invalid
 
10:37 AM
from the original challenge I had assumed all of those were invalid. basically, the = form a path starting underneath the S that can either go right, down or up, and isn't going to touch or overlap itself
that is fairly clear to specify and doesn't require dozens of test cases to cover all weird edge cases
 
I think perhaps
---------
 =
 =   E
S=   ===
==   =
 =   ==
 =====
---------
should be invalid
for consistency. Is this a good idea @TùxCräftîñg?
 
what is a good idea ?
 
Making that example invalid
 
yes, this example is invalid
 
Ok. so, the rules on how it works:
There is one origin point.
from this point, and any other point, the path may go one up, one down, or one right. It may not go one left. It may intersect itself
 
10:43 AM
yes
 
ok, I'm nearly ready to make a new edit
Ok, I made the new edit. Is it good?
 
i think this is good
 
@MartinEnder I have made the appropriate corrections
is it a bad sign that noone has commented on my sandbox submission yet?
 
11:02 AM
@zʏᴀʙiɴ101 It seems to be doing that now every several hours or so
 
@LegionMammal978 D:
 
11:22 AM
i am back
 
Hey everyone :) I want to make people implement a more complex version of my formula satisfieability challenge. I don't think this can be called "code-golf" anymore then because of the implied complexity. What would be the right category?
 
Could you link your challenge?
 
@flawr the old one and the new one will basically replace "variables" with "(quantified) predicates of terms of variables"
(I didn't write the new one down yet)
 
11:34 AM
I want to make a simple application (with nice GUI) which takes in two numbers and returns their sum. Under which platform is this the easiest?
 
@JesterTran You mean their sum?
 
@flawr yeah
 
@JesterTran platform ? library or OS ?
 
Probably javascript then with html.
 
Sorry, I forgot to say there must exist an executable to open the app
 
11:35 AM
use a library like QT or GTK+ then
 
@TùxCräftîñg how about for OS?
 
you can cross-compile
 
@JesterTran That's just a few additional lines if you want to use python for your executable.
 
he have sayed a executable
so i think he want a stand-alone executable
 
@SEJPM What kind of winning criterion do you think is suitable?
@TùxCräftîñg an executable to open the app
 
11:38 AM
@TùxCräftîñg oh cool, do you recommend it for a beginner with some knowledge of programming?
 
first, try to create a application for your current OS
 
OS X
or windows
idk whcih one to pick
 
@flawr I can only think of shortest length, but OTOH I don't really know the usual winning criteria besides shortest length here :/
 
@MartinEnder, is the Mario navigation question clear enough to be unheld now, or what needs to be done to unhold it?
 
@JesterTran formlayout is a python framework based on Qt for small stuff like it seems you inted to do
 
11:40 AM
OSX is better for programming (XCode, the ide is in the installation cd)
 
@flawr Wow, that may be a great start for me. Thanks
@TùxCräftîñg I have that installed
 
@Dennis What are the requirements to get a language on TIO?
 
@SEJPM You might want to skim through the tags to see if you can find something that fits=)
 
@flawr is it generally frowned upon to re-post a specific challenge once as code-golf and once as fastest-code ?
 
11:56 AM
what is that image?
 
it's Donald Duck
washing his car
.__.
 
but
why?
That feeling when you beat someone at code golf using the same language >:)
 
0
A: Sandbox for Proposed Challenges

LynnEvaluate an expression of ternary operators Consider the context-free grammar over {0, 1, ?, :} defined by S → 0 | 1 | S?S:S . Given a string generated by S, parse it as an expression where ?: is right-associative (a?b:c?d:e?f:g means a?b:(c?d:(e?f:g))) and evaluate it with the following semanti...

 
idk .____________.
 
the sandbox bot's 'about' text though
 
12:07 PM
@Fatalize It must be safe to run on the server (no arbitrary code execution, file access, internet access, etc.) and have an compiler/interpreter for Ubuntu. Depending on the language you implemented it in, I might also need some help with the setup.
 
So no file writing?
 
No one has noticed my sandbox post yet ._.
 
@DestructibleWatermelon link?
 
How do i do links to specific answers?
figured it out
0
A: Sandbox for Proposed Challenges

Destructible Watermelonking-of-the-hill KotH Chess Warriors. This game will be based on fairy chess, but really could be imagined to be anything else. Submissions will include both: A function that determines the moves of the piece (as in, how the piece can move), called at the start, and a function that determines ...

 
@Dennis Also, I assume the "Input/Arguments/Output" format of TIO is fixed and the same for all languages?
 
12:28 PM
Searching emergence with apgsearch offline version.
Currently at 3000 soups, seed AA, haul size 10000.
3400 soups!
3600 soups!
 
Half way!
@TùxCräftîñg -._(._.)_.-
 
who have putted the backspace key at the top of the enter key ._.
 
@TùxCräftîñg about your shwa pseudo keyboard:
 
12:34 PM
You would do a rectangle skewed a bit, or with the peak?
@LegionMammal978 Doing a search with apgsearch offline version.
 
0
A: Sandbox for Proposed Challenges

SEJPMIt's time to unify! code-golf logic math Introduction Wouldn't it be awesome if they whole world would be united and there would be no conflicts and disputes? Now while you can't unify nations, you certainly can unify expressions to resolve their unknown relation and conflicts. Your mission ...

 
@zʏᴀʙiɴ101 ^^
(The site is back up now)
 
@zʏᴀʙiɴ101 idk -._(._.)_.-
 
@LegionMammal978 Ikr.
 
12:36 PM
@zʏᴀʙiɴ101 Which rule?
 
@TùxCräftîñg I meant, choose one of the shapes above ^
@LegionMammal978 Regular B3/S23.
Seed AA, haul size 10000 soups.
 
the shape at the bottom seem more natural
 
I've been working on B45/S12
 
@LegionMammal978 On an online version?
apgmera, eh?
8000 soups!
 
@zʏᴀʙiɴ101 yep, running on half my i7
 
12:39 PM
Thousand left!
 
the shape at the bottom seem more natural
S**** DLINK ROUTER FKEUDIHJILSIUKYHUJIOHJIO HDIJOIO
 
@TùxCräftîñg Okay, so with a peak?
 
@zʏᴀʙiɴ101 I'm running 1Msoup per haul, takes about a minute per haul
 
Home stretch!
 
12:42 PM
Core 0:         +77.0°C  (high = +80.0°C, crit = +98.0°C)
Core 1:         +81.0°C  (high = +80.0°C, crit = +98.0°C)
Core 2:         +78.0°C  (high = +80.0°C, crit = +98.0°C)
Core 3:         +73.0°C  (high = +80.0°C, crit = +98.0°C)
Getting a bit toasty in there
 
Finish!
 
\o/
^ Little animated comment there
 
@LegionMammal978 I ran one haul with 10000 soups, on my old PC it takes (with 10 soups per second) around 15 minutes (sans the time to parse the emergence).
 
what is apgsearch ?
 
12:44 PM
@zʏᴀʙiɴ101 Mine wouldn't be a half-bad gaming PC, if only it had a reasonable graphics card
 
@TùxCräftîñg The Ash Pattern Generator (or A. P. Goucher search), a high-performance soup searcher.
 
cant download with FDM from sourceforge .___________________________.
 
@TùxCräftîñg You're probably looking in the wrong place. :d
See ^^.
 
i am downloading a thing from SF and i cant download with FDM :(
 
Ah k :)
 
12:48 PM
apgmera need python 2 ._________________________________________________________________.
 
But yeah, apgmera currently has a bug causing it to not play nice with newer GCC
(I found an easy fix and submitted a bug report)
 
@TùxCräftîñg It does, for recompiling itself. A bit of a self-changing program.
I don't know if apgnano needs Python 2.
 
> and the suffix '-mera' refers to the chimeric nature of the program (which recompiles itself whenever a different rule is specified).
 
fatal error: omp.h: no such file or directory
._.
 
@TùxCräftîñg You need OpenMP for that.
 
12:52 PM
where i can download omp ._.
 
@TùxCräftîñg -._(._.)_.-
Also, I got back my simple search shortcut.
I can enter apg, space, followed by the apg code of an object, to look it up in B3/S23.
Tutorial for Firefox:
2) Right click the apgcode text field.
3) Choose "Add Short Name for this Search."
4) Enter a name for the "bookmark" in the "Name" field, and apg in the "Short Name" field.
5) Save.
Bam done.
 
@TùxCräftîñg WAT
python2 is best python
 
python3 is the best
 
WAT
python2 is best python
 
no it's py3K
 
12:59 PM
WAT
python2 is best python
 
you dont understand ._. python3 is the best
 
@RohanJhunjhunwala sorry, left and that didn't ping me. My name is weird.
But yeah, almost anybody could help you.
I would have if I didn't had to leave.
@DrGreenEggsandIronMan Portal 2 test-chamber-creator confirms "Portalable", not "Portable".
¯\_(ツ)_/¯
 
apgnano is compiling \o/
apgnano compiling has failed /o\
 
Try apgsearch 1, or continue trying to do apgnano?
 
error: libgomp.spec: no such file or directory ._______________________________________________________________________________________.
i give up ._.
i have been lost on wikipedia and found this:
> On June 13, 2016, Microsoft announced it will acquire LinkedIn for $26.2 billion, a deal expected to be completed by the end of 2016.
.____________________________________________.____________________________________________.
 
1:28 PM
@TùxCräftîñg i do understand how wrong you are?
 
i am not wrong. you are wrong by saying py2 is the best
because py3 is the best
 
hahaha you're not funny
 
i am not funny i'm telling the truth.
 
you got the first part right
 
and the second part is also right
 
1:34 PM
i don't think so
 
even jelly is written in py3
 
yes
jelly is boring IMO
 
05AB1E too is writen in py3
 
that also doesn't really matter
what's so great about 3?
 
3 is far simpler
 
1:35 PM
in what way?
 
xrange and range in py2, only range in py 3
 
It's practically the same except for a couple new/old functions add/remov ed
 
print and exec are now functions
 
> far
yes
@TùxCräftîñg see above
 
The only way to settle this is with a contest.
 
1:37 PM
I prefer py2 but I wrote pyke in py3 because it has function annotations
 
like def partition(self, string:str, sep:str):
 
@trichoplax give a challange?
 
Are you trying to prove it's faster, terser, more memory efficient, readable, writable, something else...?
 
more awesome
 
1:38 PM
@trichoplax better in general
 
yes that's objective
 
OK that's easy then. You each write a program in your chosen language, and then whichever one is better in general wins
 
what kind of program ?
 
1:39 PM
Now we just need to define that objectively...
 
@TùxCräftîñg I suggest a golfing contest. You pick a easyish challenge on main, and we both try to solve it.
 
@SEJPM It is probably going to be closed as a dupe, so yes, probably.
 
easyish means not add 2 numbers, but not something really hard.
 
sure
not my first choice, but that works
@TùxCräftîñg 321goalready
 
1:43 PM
i have already started my program :c
 
k
doesn't matter
was mostly a joke
 
Looking at my own challenges, python 2 and 3 seem to be fairly balanced against each other, with 3 slightly ahead for non-golf challenges
 
yeah
@TùxCräftîñg you done?
>_> my solution is identical no matter which version
so probably a tie
 
matchine consecutives chars is harder than i thought .________________.
 
try itertools combinations
 

« first day (1988 days earlier)      last day (2849 days later) »