Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with logic-gates
Search options not deleted
user 55896
A challenge either involving using logic-gates as the coding language or outputting logic gates.
33
votes
Golf all the 16 logic gates with 2 inputs and 1 output!
Chess/mediocre chess player in endgame, 70 pieces
Inspired by that domino answer, I decided another game should have this honor.
Note that I took a few rules for how the pieces move. Because I don't …
- 6,398
3
votes
Golf all the 16 logic gates with 2 inputs and 1 output!
Stackylogic, 106 105 bytes (non-competing)
Sort of what this language is made for.
It was made after the challenge, so non-competing
1 moves the pointer down one, and removes itself
0 moves the p …
- 6,398
1
vote
Run Stackylogic
Python 3, 318
def s(f,z):
p=b="";g=0;a=[];n=a.append;n(p)
for i in f:
if i=="\n":n(p);p=''
else:p+=i
n(p);p=b;n(p)
while g<len(a):
if'<'in a[g]:q=g;a[q]=a[q][:-1]
g+=1
while 1:
v=a[q]
…
- 6,398