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 how it moves each ...
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
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
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
@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.
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
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?
Evaluate 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...
@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.
king-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 ...
It'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 ...
@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).
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.