Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
import random
def init_game():
global stack, wallet, max_taken, oracle_turns
stack = list(range(1, 10001))
random.shuffle(stack)
wallet = max_taken = oracle_turns = 0
def read():
return stack[0]
def take():
global wallet, max_taken
amount = stack.pop(0)
if amount > max_taken:
wallet += amount
max_taken = amount
def passe():
stack.pop(0)
def oracle(M):
global oracle_turns
if oracle_turns > 0:
raise ValueError("Used Oracle too soon")
if M > len(stack) + 1:
raise ValueError("Not enough envelopes left")
oracle_turns = M
return sum(stack[1:M+1])/M
def test(algo, N=50):
global oracle_turns
results = []
for rep in range(N):
init_game()
for i in range(10000):
oracle_turns -= 1
algo()
results.append(wallet)
print(sorted(results)[N//2])
#Simplist algo, always takes
def algo_simple():
take()
test(algo_simple)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.