About

Monte-Carlo tree search using flood fill from each snake head ordered by length, making tails traversable depending on distance. For 1v1 just optimize the size of controlled area, otherwise also add bonuses for food in controlled area and health.

Public C++ v7 API v1 Latency

Created Sept. 1, 2020

Recent Games
  • Global Arena

    4 Battlesnakes, 11x11 Board, 195 Turns

    6 hours ago

  • Created by tofu

    4 Battlesnakes, 11x11 Board, 464 Turns

    1 day, 13 hours ago

  • Created by tofu

    3 Battlesnakes, 11x11 Board, 225 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 11x11 Board, 10 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 11x11 Board, 10 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 19x19 Board, 10 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 19x19 Board, 113 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 19x19 Board, 160 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 11x11 Board, 277 Turns

    2 days, 11 hours ago

  • Created by tofu

    2 Battlesnakes, 11x11 Board, 277 Turns

    2 days, 11 hours ago

Resources
Community
Copyright © 2021 Battlesnake Inc.

Version 1.4.42

Battlesnake is proudly supported by

Amazon Web Services GitHub Repl.it

Interested in becoming a partner?