Hello Math-Fun If you've seen this: https://www.futilitycloset.com/2020/03/13/a-self-describing-table/ ... I'm happy to show here the same task done in base 2, with a 37-line array computed by Gilles Esposito-Farèse: 11 0, 100 1. 1001 0, 1000 1. 10000 0, 1100 1. 10101 0, 10011 1. 11001 0, 11011 1. 11110 0, 100011 1. 100101 0, 101010 1. 101011 0, 110010 1. 110001 0, 111010 1. 111010 0, 1000000 1. 111111 0, 1001010 1. 1001001 0, 1010000 1. 1001111 0, 1011010 1. 1010110 0, 1100011 1. 1011011 0, 1101110 1. 1011111 0, 1111010 1. 1101001 0, 10000001 1. 1110010 0, 10001001 1. 1111001 0, 10010011 1. 10000100 0, 10011010 1. 10001110 0, 10100010 1. 10011000 0, 10101010 1. 10100010 0, 10110010 1. 10101001 0, 10111101 1. 10110001 0, 11000111 1. 10111010 0, 11010000 1. 11000100 0, 11011000 1. 11001011 0, 11100011 1. 11010001 0, 11101111 1. 11011000 0, 11111010 1. 11100100 0, 100000001 1. 11110000 0, 100001000 1. 11111001 0, 100010010 1. 100000101 0, 100011010 1. 100010010 0, 100100001 1. 100011100 0, 100101011 1. 100100110 0, 100110101 1. Gilles backtracked the array on the last 10 lines, at every step, when he was blocked. He tells me that 37 might be easy to beat... and why not with an infinite array! Best, É. (my page is here, with more results (to beat): http://cinquantesignes.blogspot.com/2020/03/peche-la-ligne.html)