# BankHeist-v0

Maximize your score in the Atari 2600 game BankHeist. In this environment, the observation is an RGB image of the screen, which is an array of shape (210, 160, 3) Each action is repeatedly performed for a duration of \(k\) frames, where \(k\) is uniformly sampled from \(\{2, 3, 4\}\).

## BankHeist-v0 Evaluations

Algorithm | Best 100-episode performance | Submitted |
---|---|---|

ppwwyyxx's algorithm writeup | 1274.60 ± 8.04 | |

Mariewelt's algorithm writeup | 107.40 ± 3.62 | |

Mariewelt's algorithm writeup | 68.80 ± 2.82 | |

Mariewelt's algorithm writeup | 62.30 ± 2.16 | |

gdb's algorithm writeup | 15.90 ± 1.11 | |

ceobillionaire's algorithm | 1292.10 ± 5.16 | |

ceobillionaire's algorithm | 139.40 ± 4.52 | |

ceobillionaire's algorithm | 43.00 ± 3.27 | |

gdb's algorithm | 16.70 ± 1.21 | |

justheuristic's algorithm | 0.00 ± 0.00 |