Typescript in the streets
Rust in the sheets

Started work on building a #Battlesnake in Rust. I've already sketched out the main building blocks and have a working flood fill algorithm. I'm thinking of taking another crack at breadth first search (if I can wrap head around recursive generics).

I'm also curious to abuse the u128 as a bit board, but I gotta get the thing working before I optimize.

Instead of #Dijkstra's algorithm, I used the flood fill algorithm. The last time I have used it was for my #battlesnake more than one year ago, so it saved me a lot of time today.

https://gist.github.com/thomasweitzel/0637e0676f9553f7f41e6dbac006dcce

Instead of #Dijkstra's algorithm, I used the flood fill algorithm. The last time I have used it was for my #battlesnake more than one year ago, so it saved me a lot of time today.

https://gist.github.com/thomasweitzel/0637e0676f9553f7f41e6dbac006dcce

Instead of #Dijkstra's algorithm, I used the flood fill algorithm. The last time I have used it was for my #battlesnake more than one year ago, so it saved me a lot of time today.

https://gist.github.com/thomasweitzel/0637e0676f9553f7f41e6dbac006dcce

Registration is now open for the #Battlesnake fall league: https://blog.battlesnake.com/fall-league-registration-is-open/

For those who don't know, it's a competitive programming challenge where you create a webserver that plays a multiplayer version of the classic game "snake". It's a lot of fun and you can use whatever tech you want.

This season I'm working on a snake built with #golang that builds a lookahead behavior tree to find the best move each turn. The snake's name? Stacy's Mamba

In the effort to be (somewhat) competitive in #Battlesnake fall league, I've decided to take the dive into AI algorithms. No more chains of IF statements for me!

At the moment I'm working on building out a minimax behavior tree, but I've yet to decide on a heuristic function.

Working in #golang has really helped

I've been off-and-on working on a #Battlesnake that I entered into the spring competitive league.

Snake Gyllenhaal 🐍

It wasn't very successful initially, but now I got:
- snake avoidance (including wrapped snakes)
- preference against hazards
- preference against potential head to head collisions with bigger snakes (again, factoring in wrapped mode)

Now I've gotta pick a high-level strategy: hungry snake (astar algorithm), shy guy (flood fill algorithm), chaos snake (as-is).

Have y'all seen #Battlesnake 🐍

https://play.battlesnake.com

You create a server that accepts HTTP requests to control a snake and the you BATTLE WITH IT!!

I just spent several hours making a (very dumb) snake in Python (cause what else would I code it in?)