What logic gates work given the input?

Question

Introduction

Logic gates! Everyone knows them, everyone loves them (unless you're starting to learn them). Take two booleans, compare them, get a single boolean in return. AND, NAND, OR, NOR, XOR, XNOR. Fun! But, what if you only had the inputs and output, but not the operator?

Challenge

Given a three digit number, xyz, where x and y are inputs to the unknown gate(s) and z is the output, list all the possible gates. The output order doesn't matter but it must be all caps and separated by a space. This is code-golf, so the shortest answer wins!

Example Inputs and Outputs

Inputs:

001

101

111

Outputs:

NAND NOR XNOR

NAND OR XOR

AND OR XNOR

Answer 1

JavaScript (ES6),  58  56 bytes

n=>`25AND 41OR X37OR`.replace(/\d+/g,m=>m>>n%6&1?'':'N')

Try it online!

How?

Given the input \$n\$, we compute \$n\bmod 6\$ to get an index into 3 small lookup bit masks.

It's worth noting that all operations are commutative, i.e. \$(X \operatorname{op} Y)=(Y \operatorname{op} X)\$ even when \$X=\lnot Y\$. So the collisions between 011 and 101 and between 010 and 100 are actually very welcome.

 n (decimal) | n mod 6 | NAND | NOR | XNOR
-------------+---------+------+-----+------
  011 or 101 |    5    |   0  |  1  |  1
  010 or 100 |    4    |   1  |  0  |  0
         111 |    3    |   1  |  1  |  0
         110 |    2    |   0  |  0  |  1
         001 |    1    |   0  |  0  |  0
         000 |    0    |   1  |  1  |  1
                           |     |     |
                           |     |     +--> 0b100101 = 37
                           |     +--------> 0b101001 = 41
                           +--------------> 0b011001 = 25

We look for the bit masks in the string "25AND 41OR X37OR" and replace them with either "N" or an empty string.

Answer 2

Jelly, 33 bytes

V€Ḅ“n|ḃ’b⁹¤æ»ị“N“”ż“AND “OR X“OR”

Try it online!

Explanation

V€Ḅ“n|ḃ’b⁹¤æ»ị“N“”ż“AND “OR X“OR”  Main Link
 €                                 For each character
V                                    evaluate it (into 0 or 1)
  Ḅ                                  convert the input string to binary
   “n|ḃ’b⁹¤                        [106, 86, 150]:
   “n|ḃ’                             6968982
        b                            in base
         ⁹                           256
           æ»                      Right shift each number by the input (those three numbers encode whether or not the N needs to be present)
              ị                      and index into
               “N“”                  ["N", ""] (odd = N, even = "", since Jelly lists wrap)
                   ż                 interleave it with
                    “AND “OR X“OR”   "AND ", "OR X", "OR"
                                    Final result is [N]AND [N]OR X[N]OR

Answer 3

Python 3, 98 88 78 bytes

lambda s:'%sAND %sOR X%sOR'%(*[eval(s[0]+o+s[1]+'!='+s[2])*'N'for o in'&|^'],)

Try it online!

Thanks to ovs for -20 bytes

Answer 4

Charcoal, 33 bytes

Ｎθ⭆vAND jOR XiOR⎇‹ι_ι×NΣ§◧⍘℅ι01⁸θ

Try it online! Link is to verbose version of code. Explanation: The lowercase letters' ASCII codes encode the binary patterns for where the Ns appear. This algorithm actually depends on the input being an integer and the output being in upper case. Although the input is taken in base 10, the cyclic indexing means that the values are equivalent to base 2.

Ｎθ                                  Input the 3-digit number
   vAND jOR XiOR                    Literal string `vAND jOR XiOR`
  ⭆                                 Map over characters and join
                  ι                 Current character
                 ‹                  Is less than
                   _                Literal `_`
                ⎇                   If true then
                    ι               Current character else
                      N             Literal `N`
                     ×              Repeated by
                       Σ            Extract decimal value of
                            ι       Current character
                           ℅        ASCII code
                          ⍘  01     Converted to base 2
                         ◧     ⁸    Left padded to length 8
                        §           Cyclically indexed by
                                θ   Input number

Answer 5

Python 3.8, 72 59 bytes

lambda n:f'{n%15%2*"N"}AND {n*3%17%2*"N"}OR X{n%9%2*"N"}OR'

Try it online!

Expects input as a decimal number.

-13 bytes thanks to ovs' modular dark magic

I squinted at the numbers very hard until I found these three formulae ovs chained all the modulos:

• n&1!=n//110 <=> "the last digit is 1 and n is not 111; or n == 110"
• n%2!=(n>2) <=> "the last digit is 0 and n is nonzero; or n == 001"
• n%9%2 <=> "the number of 1 in the digits of n is odd"

Answer 6

Pyth, 53 bytes

%"%sAND %sOR X%sOR"[*\Nn&=vz1/z110*\Nn%z2>z2*\N%%z9 2

Try it online!

Port of a previous version of Stef's Python 3.8 answer.

Pyth, 64 61 bytes

-3 bytes by using string formatting.

A,shzs@z1=Tsez%"%sAND %sOR X%sOR"[?x&GHT\Nk?x|GHT\Nk?xxGHT\Nk

Try it online!

First time golfing in Pyth!

Answer 7

05AB1E, 35 bytes

’n€ƒxš¯š¯’4ôuεI`Š…*+~Nè.VQi'Nõ.;]ðý

Try it online or verify all test cases.

Explanation:

’n€ƒxš¯š¯’                 # Push dictionary string "nandxnornor"
  4ô                       # Split it into parts of size 4: ["nand","xnor","nor"]
    u                      # Uppercase each string: ["NAND","XNOR","NOR"]
     ε                     # Map over each string:
      I                    #  Push the input
       `                   #  Pop and push its digits separated to the stack
        Š                  #  Triple-swap the values on the stack: a,b,c → c,a,b
         …*+~              #  Push string "*+~"
             Nè            #  Index the map-index into this string
               .V          #  Execute it as 05AB1E code:
                           #   *: Multiply the top two values on the stack
                           #   +: Add the top two values on the stack
                           #   ~: Bitwise-OR the top two values on the stack
                 Qi        #  If this is equal to the third value that was on the stack:
                   'Nõ.;  '#   Remove the first "N" in the string
     ]                     # Close the if-statement and map
      ðý                   # And join the list with space delimiter
                           # (after which the result is output implicitly)

See this 05AB1E tip of mine (section How to use the dictionary?) to understand why ’n€ƒxš¯š¯’ is "nandxnornor".
The ’n€ƒxš¯š¯’4ôu could alternatively also have been .•UNœTǨ₆~•# for the same byte-count.

Answer 8

C (gcc), ⁷⁸ 73 bytes

Saved 5 bytes thanks to ceilingcat!!!

f(n){n=1<<n%6;printf("NAND %sOR X%sOR"+!(n&38),"N"+!(n&22),"N"+!(n&26));}

Try it online!

Inputs a three digit decimal number representing the two boolean arguments and the result of a boolean operator and outputs all possible operators to stdout.

Uses that super-handy lookup table from Arnauld's JavaScript answer.

Answer 9

Java (OpenJDK 8), 143 bytes

void A(int a){for(int i=-1;i++<5;)if((7+21*((a+2)/4)>>i&1)==a%2)System.out.print(new String[]{"AND","OR","XOR","NAND","NOR","XNOR"}[5-i]+" ");}

Try it online! (More details inside)

Input is a single 3 digit number, interpreted as binary. Example input: "A(0b101);"

Explanation:

 (...)
 if((7+21*((a+2)/4)>>i&1)==a%2)
     7+21*(       )                 // The shortest interpolation equation (see bottom of tio.) I could find, for the "x" values of
                                    //   0, 1, 2, representing 00_, 01_ / 10_, 11_ respectively.
           (a+2)/4                  // The sum of the second and third bit, found this equation with brute force,
                                    //   alternative: (a|1)/3, needs parentheses because of bit operation order.
                   >>i&1            // The bit at i, delete all bits except the first to compare it with:
                        )==a%2)     // The first digit of a. (like "number % 10", except for binary)

And, I'm pretty sure you can print the answer when asked to return it.