The binary does not properly seed random values. Thus, we can expect the same outcome every time. We patched the original binary to always succeed and then exame all the correct words.
```./gambler-baby1.patched | grep wordCorrect word: nwlrCorrect word: bbmqCorrect word: bhcdCorrect word: arzoCorrect word: wkky```
Thus, our solution just calls the output from the [patched binary](https://github.com/tj-oconnor/ctf-writeups/blob/main/b01lers_ctf/gambler_baby/gambler-baby1.patched) and feeds it to the unpatched binary.
```python
from pwn import *
binary = args.BIN
context.terminal = ["tmux", "splitw", "-h"]e = context.binary = ELF(binary)r = ROP(e)
gs = '''continue'''
def start():    if args.GDB:        return gdb.debug(e.path, gdbscript=gs)    elif args.REMOTE:        return remote('ctf.b01lers.com', 9201)    else:        return process(e.path)
p = start()patched_p = process('./gambler-baby1.patched')
while (True):    try:        patched_p.recvuntil(b'Correct word: ')        line = patched_p.recvline().strip(b'\n')        p.sendline(line)        print(p.recvline())    except:        breakp.interactive()```