search

carykh / PrisonersDilemmaTournament

Watch This Place's awesome video about iterated Prisoner's Dilemma for context! https://www.youtube.com/watch?v=BOvAbjfJ0x0
MIT License
206 stars 160 forks source link

How the heck is this gonna be actually run #68

Open cadyn opened 3 years ago

cadyn commented 3 years ago

I assume at least a few of us here are going the route of NN where some computationally expensive matrix multiplication might need to be done to evaluate the results. I think carykh said it would repeat the tournament like 1000 times to help eliminate randomness, and that's ontop of every one of our agents playing every other agent. The sum of all of this is that this is gonna take a lot of computational power, maybe too much to be even practical?

duckboycool commented 3 years ago

See #20 for if you should worry about your own strategy in terms of time, but otherwise it will probably take a while but not too long. Depending on the amount of final strategies, it will probably take a couple weeks as is, but that should be able to be brought down quite a bit if multiprocessing and non-random strategy caching are added. #17

redtachyon2098 commented 3 years ago

I'm using neural networks, and mine executes and returns in around 5ms, even with all the debug features enabled.

RavindraWiguna commented 3 years ago

isn't using another library other than NumPy and random is not allowed? or building our own NN from scratch is ok?

redtachyon2098 commented 3 years ago

isn't using another library other than NumPy and random is not allowed? or building our own NN from scratch is ok?

As long as you'r not importing another library, and you aren't reading-writing any files, and you're not stalling on purpose, anything goes. I have made a simple nn library that only uses random(And time, but only for the debug logs, which isn't necessary. I actually have a repo of this but please don't look at it) a while back, so one ctrl+c ctrl+v and a few modifications later, I got it working.