Skip to main content
added 2 characters in body
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139

I can do (and this is minimal):

3 questions (for both variations, this is minimal because there are only 3 possible responses and 32<4!)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the following dictionary (see dictionary below, Batman will have to recite this but I won't add it here), and took the first/second/third change this for each question - each corresponding to the question number asked letter of the identifier, will either the letter be Y and you are telling the truth, the digitletter be N and you are lying, or the letter be P and either you will lie and say yes or tell the truth and say no?

Then:

Yes means Y, no means N and pass means P since the option for P is a head-exploding statement. Then you can reconstruct the three letter identifier, back-index into dictionary and find the order!

Dictionary:

JPRT: YNY
JPTR: YNN
JRPT: YNP
JRTP: YPY
JTPR: YPN
JTRP: YPP
PJRT: NYY
PJTR: NYN
PRJT: NNY
PRTJ: PPP
PTJR: PNY
PTRJ: PNP
RJPT: NYP
RJTP: PYY
RPJT: NPY
RPTJ: NPP
RTJP: PPY
RTPJ: NNP
TJPR: PYN
TJRP: PYP
TPJR: NNN
TPRJ: YYP
TRJP: PNN
TRPJ: YYN

Examples:

Riddler, letter=Y: "The letter is Y, and I am telling the truth. So true, and I say yes."
Riddler, letter=2: "The letter is not Y. The letter is N, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, letter=P: "The letter is not Y or N. The letter is P, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, letter=Y: "The letter is Y, but I am lying. So false, but I say yes."
Penguin, letter=N: "The letter is not Y. The letter is N, and I am lying. So true, but I say no."
Penguin, letter=P: "The letter is not Y or N. The letter is P, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying. Note - the Joker will never be given a head-exploding question

I can do (and this is minimal):

3 questions (for both variations, this is minimal because there are only 3 possible responses and 32<4!)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the following dictionary (see dictionary below, Batman will have to recite this but I won't add it here), and took the first/second/third change this for each question - each corresponding to the question number asked letter of the identifier, will either the letter be Y and you are telling the truth, the digit be N and you are lying or the letter be P and either you will lie and say yes or tell the truth and say no?

Then:

Yes means Y, no means N and pass means P since the option for P is a head-exploding statement. Then you can reconstruct the three letter identifier, back-index into dictionary and find the order!

Dictionary:

JPRT: YNY
JPTR: YNN
JRPT: YNP
JRTP: YPY
JTPR: YPN
JTRP: YPP
PJRT: NYY
PJTR: NYN
PRJT: NNY
PRTJ: PPP
PTJR: PNY
PTRJ: PNP
RJPT: NYP
RJTP: PYY
RPJT: NPY
RPTJ: NPP
RTJP: PPY
RTPJ: NNP
TJPR: PYN
TJRP: PYP
TPJR: NNN
TPRJ: YYP
TRJP: PNN
TRPJ: YYN

Examples:

Riddler, letter=Y: "The letter is Y, and I am telling the truth. So true, and I say yes."
Riddler, letter=2: "The letter is not Y. The letter is N, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, letter=P: "The letter is not Y or N. The letter is P, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, letter=Y: "The letter is Y, but I am lying. So false, but I say yes."
Penguin, letter=N: "The letter is not Y. The letter is N, and I am lying. So true, but I say no."
Penguin, letter=P: "The letter is not Y or N. The letter is P, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying. Note - the Joker will never be given a head-exploding question

I can do (and this is minimal):

3 questions (for both variations, this is minimal because there are only 3 possible responses and 32<4!)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the following dictionary (see dictionary below, Batman will have to recite this but I won't add it here), and took the first/second/third change this for each question - each corresponding to the question number asked letter of the identifier, will either the letter be Y and you are telling the truth, the letter be N and you are lying, or the letter be P and either you will lie and say yes or tell the truth and say no?

Then:

Yes means Y, no means N and pass means P since the option for P is a head-exploding statement. Then you can reconstruct the three letter identifier, back-index into dictionary and find the order!

Dictionary:

JPRT: YNY
JPTR: YNN
JRPT: YNP
JRTP: YPY
JTPR: YPN
JTRP: YPP
PJRT: NYY
PJTR: NYN
PRJT: NNY
PRTJ: PPP
PTJR: PNY
PTRJ: PNP
RJPT: NYP
RJTP: PYY
RPJT: NPY
RPTJ: NPP
RTJP: PPY
RTPJ: NNP
TJPR: PYN
TJRP: PYP
TPJR: NNN
TPRJ: YYP
TRJP: PNN
TRPJ: YYN

Examples:

Riddler, letter=Y: "The letter is Y, and I am telling the truth. So true, and I say yes."
Riddler, letter=2: "The letter is not Y. The letter is N, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, letter=P: "The letter is not Y or N. The letter is P, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, letter=Y: "The letter is Y, but I am lying. So false, but I say yes."
Penguin, letter=N: "The letter is not Y. The letter is N, and I am lying. So true, but I say no."
Penguin, letter=P: "The letter is not Y or N. The letter is P, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying. Note - the Joker will never be given a head-exploding question

Fixed it up!
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139

I can do (and this is minimal) [EDIT: this may be invalid because of undefined behaviour]:

3 questions (for both variations, this is minimal because there are only 3 possible responses and 32<24<4!)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the list of twenty-four permutations of those four letters in lexicographical orderfollowing dictionary (see dictionary below, Batman will have to recite this but I won't add it here), and took the onesfirst/threessecond/ninesthird a different one of the three optionschange this for each question - each corresponding to the question number asked digitletter of that number in ternary, is the following statement true: 'eitheridentifier, will either the digit is oneletter be Y and you are telling the truth, the digit is twobe N and you are lying or the digit is zeroletter be P and either you will lie and say yes or tell the truth and say no'no?

Then:

Yes means 1Y, no means 2N and pass means 0P since the option for 0P is a head-exploding statement. Then you can reconstruct the numberthree letter identifier, back-index into the aforementioned listdictionary and find the order!

Index of orderDictionary:

JPRT,: YNY
JPTR,: YNN
JRPT,: YNP
JRTP,: YPY
JTPR,: YPN
JTRP,: YPP
PJRT,: NYY
PJTR,: NYN
PRJT,: NNY
PRTJ,: PPP
PTJR,: PNY
PTRJ,: PNP
RJPT,: NYP
RJTP,: PYY
RPJT,: NPY
RPTJ,: NPP
RTJP,: PPY
RTPJ,: NNP
TJPR,: PYN
TJRP,: PYP
TPJR,: NNN
TPRJ,: YYP
TRJP,: PNN
TRPJ: YYN

Examples:

Riddler, digit=1letter=Y: "The digitletter is 1Y, and I am telling the truth. So true, and I say yes."
Riddler, digit=2letter=2: "The digitletter is not 1Y. The digitletter is 2N, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, digit=0letter=P: "The digitletter is not 1Y or 2N. The digitletter is 0P, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, digit=1letter=Y: "The digitletter is 1Y, but I am lying. So false, but I say yes."
Penguin, digit=2letter=N: "The digitletter is not 1Y. The digitletter is 2N, and I am lying. So true, but I say no."
Penguin, digit=0letter=P: "The digitletter is not 1Y or 2N. The digitletter is 0P, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying. Note - the Joker will never be given a head-exploding question

I can do (and this is minimal) [EDIT: this may be invalid because of undefined behaviour]:

3 questions (for both variations, this is minimal because there are only 3 responses and 32<24)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the list of twenty-four permutations of those four letters in lexicographical order, and took the ones/threes/nines a different one of the three options for each question digit of that number in ternary, is the following statement true: 'either the digit is one and you are telling the truth, the digit is two and you are lying or the digit is zero and either you will lie and say yes or tell the truth and say no'?

Then:

Yes means 1, no means 2 and pass means 0 since the option for 0 is a head-exploding statement. Then you can reconstruct the number, back-index into the aforementioned list and find the order!

Index of order:

JPRT,JPTR,JRPT,JRTP,JTPR,JTRP,PJRT,PJTR,PRJT,PRTJ,PTJR,PTRJ,RJPT,RJTP,RPJT,RPTJ,RTJP,RTPJ,TJPR,TJRP,TPJR,TPRJ,TRJP,TRPJ

Examples:

Riddler, digit=1: "The digit is 1, and I am telling the truth. So true, and I say yes."
Riddler, digit=2: "The digit is not 1. The digit is 2, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, digit=0: "The digit is not 1 or 2. The digit is 0, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, digit=1: "The digit is 1, but I am lying. So false, but I say yes."
Penguin, digit=2: "The digit is not 1. The digit is 2, and I am lying. So true, but I say no."
Penguin, digit=0: "The digit is not 1 or 2. The digit is 0, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying.

I can do (and this is minimal):

3 questions (for both variations, this is minimal because there are only 3 possible responses and 32<4!)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the following dictionary (see dictionary below, Batman will have to recite this but I won't add it here), and took the first/second/third change this for each question - each corresponding to the question number asked letter of the identifier, will either the letter be Y and you are telling the truth, the digit be N and you are lying or the letter be P and either you will lie and say yes or tell the truth and say no?

Then:

Yes means Y, no means N and pass means P since the option for P is a head-exploding statement. Then you can reconstruct the three letter identifier, back-index into dictionary and find the order!

Dictionary:

JPRT: YNY
JPTR: YNN
JRPT: YNP
JRTP: YPY
JTPR: YPN
JTRP: YPP
PJRT: NYY
PJTR: NYN
PRJT: NNY
PRTJ: PPP
PTJR: PNY
PTRJ: PNP
RJPT: NYP
RJTP: PYY
RPJT: NPY
RPTJ: NPP
RTJP: PPY
RTPJ: NNP
TJPR: PYN
TJRP: PYP
TPJR: NNN
TPRJ: YYP
TRJP: PNN
TRPJ: YYN

Examples:

Riddler, letter=Y: "The letter is Y, and I am telling the truth. So true, and I say yes."
Riddler, letter=2: "The letter is not Y. The letter is N, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, letter=P: "The letter is not Y or N. The letter is P, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, letter=Y: "The letter is Y, but I am lying. So false, but I say yes."
Penguin, letter=N: "The letter is not Y. The letter is N, and I am lying. So true, but I say no."
Penguin, letter=P: "The letter is not Y or N. The letter is P, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying. Note - the Joker will never be given a head-exploding question

added 59 characters in body
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139

I can do (and this is minimal) [EDIT: this may be invalid because of undefined behaviour]:

3 questions (for both variations, this is minimal because there are only 3 responses and 32<24)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the list of twenty-four permutations of those four letters in lexicographical order, and took the ones/threes/nines a different one of the three options for each question digit of that number in ternary, is the following statement true: 'either the digit is one and you are telling the truth, the digit is two and you are lying or the digit is zero and either you will lie and say yes or tell the truth and say no'?

Then:

Yes means 1, no means 2 and pass means 0 since the option for 0 is a head-exploding statement. Then you can reconstruct the number, back-index into the aforementioned list and find the order!

Index of order:

JPRT,JPTR,JRPT,JRTP,JTPR,JTRP,PJRT,PJTR,PRJT,PRTJ,PTJR,PTRJ,RJPT,RJTP,RPJT,RPTJ,RTJP,RTPJ,TJPR,TJRP,TPJR,TPRJ,TRJP,TRPJ

Examples:

Riddler, digit=1: "The digit is 1, and I am telling the truth. So true, and I say yes."
Riddler, digit=2: "The digit is not 1. The digit is 2, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, digit=0: "The digit is not 1 or 2. The digit is 0, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, digit=1: "The digit is 1, but I am lying. So false, but I say yes."
Penguin, digit=2: "The digit is not 1. The digit is 2, and I am lying. So true, but I say no."
Penguin, digit=0: "The digit is not 1 or 2. The digit is 0, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying.

I can do (and this is minimal):

3 questions (for both variations, this is minimal because there are only 3 responses and 32<24)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the list of twenty-four permutations of those four letters in lexicographical order, and took the ones/threes/nines a different one of the three options for each question digit of that number in ternary, is the following statement true: 'either the digit is one and you are telling the truth, the digit is two and you are lying or the digit is zero and either you will lie and say yes or tell the truth and say no'?

Then:

Yes means 1, no means 2 and pass means 0 since the option for 0 is a head-exploding statement. Then you can reconstruct the number, back-index into the aforementioned list and find the order!

Index of order:

JPRT,JPTR,JRPT,JRTP,JTPR,JTRP,PJRT,PJTR,PRJT,PRTJ,PTJR,PTRJ,RJPT,RJTP,RPJT,RPTJ,RTJP,RTPJ,TJPR,TJRP,TPJR,TPRJ,TRJP,TRPJ

Examples:

Riddler, digit=1: "The digit is 1, and I am telling the truth. So true, and I say yes."
Riddler, digit=2: "The digit is not 1. The digit is 2, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, digit=0: "The digit is not 1 or 2. The digit is 0, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, digit=1: "The digit is 1, but I am lying. So false, but I say yes."
Penguin, digit=2: "The digit is not 1. The digit is 2, and I am lying. So true, but I say no."
Penguin, digit=0: "The digit is not 1 or 2. The digit is 0, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying.

I can do (and this is minimal) [EDIT: this may be invalid because of undefined behaviour]:

3 questions (for both variations, this is minimal because there are only 3 responses and 32<24)

Ask the following questions to three people:

If I took the four letters J, P, R and T, put them in the order corresponding to the order you are in where J=Joker, P=Penguin, R=Riddler and T=Two-face, indexed it into the list of twenty-four permutations of those four letters in lexicographical order, and took the ones/threes/nines a different one of the three options for each question digit of that number in ternary, is the following statement true: 'either the digit is one and you are telling the truth, the digit is two and you are lying or the digit is zero and either you will lie and say yes or tell the truth and say no'?

Then:

Yes means 1, no means 2 and pass means 0 since the option for 0 is a head-exploding statement. Then you can reconstruct the number, back-index into the aforementioned list and find the order!

Index of order:

JPRT,JPTR,JRPT,JRTP,JTPR,JTRP,PJRT,PJTR,PRJT,PRTJ,PTJR,PTRJ,RJPT,RJTP,RPJT,RPTJ,RTJP,RTPJ,TJPR,TJRP,TPJR,TPRJ,TRJP,TRPJ

Examples:

Riddler, digit=1: "The digit is 1, and I am telling the truth. So true, and I say yes."
Riddler, digit=2: "The digit is not 1. The digit is 2, but I am telling the truth, so false. The digit is not 0. So false, and I say no."
Riddler, digit=0: "The digit is not 1 or 2. The digit is 0, and I am telling the truth. If I say no, then it's true, because I say no. If I say yes, then it's false, because I don't say no. So pass."
Penguin, digit=1: "The digit is 1, but I am lying. So false, but I say yes."
Penguin, digit=2: "The digit is not 1. The digit is 2, and I am lying. So true, but I say no."
Penguin, digit=0: "The digit is not 1 or 2. The digit is 0, and I am lying. If I say yes, then it's true, and I should have said no. If I say no, then it's false, and I should have said yes. So pass."
Two-face/Joker: refer to Riddler if telling the truth, Penguin if lying.

added 59 characters in body
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139
Loading
deleted 10 characters in body
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139
Loading
added 1095 characters in body
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139
Loading
Source Link
boboquack
  • 22.1k
  • 1
  • 67
  • 139
Loading