🏆Hall of Fame for Participants from Previous Years🏆

Year	Team	Placement	Notes
2018/2019	Daniele	1° 🥇	Single threaded MinMax Iterative deeping, alpha-beta pruning and partial ordering between iterations Heuristic strongly based on playing around the king
2018/2019	O(sarracino)	2° 🥈	Multi-threading Bit operations CPU intrinsics (native processor instructions)
2018/2019	NemoTablut	3° 🥉	C language pthread Bit masks

2019/2020	FrittoMisto	1° 🥇	Java language Didn't use AIMA libraries Extra client with parameters for weights
2019/2020	B2P	2° 🥈 (Reaper)	BitSet MinMax with alpha-beta pruning (made concurrent) Simple heuristic
2019/2020	I bimbi di Giuseppe Conte	3° 🥉	C language Lazy SMP algorithm Hash tables
2019/2020	YinYIAng Warriors	4°	Kotlin language Iterative deepening alpha beta search Great explaination PDF

2020/2021	Weakmind	1° 🥇	Rust language 17 wins, 1 draw, 0 losts Unreadable code and doesn't compile Even if you fix compilation errors, server explodes at runtime :)
2020/2021	AlmaZeneca	2° 🥈	Great white heuristics Probably second just because Weakmind was a monster It compiles, but throws NullPointerExceptions after connecting to server
2020/2021	MrMeeseeks	3° 🥉

Year	Team	Placement	Notes
2019/2020	Pickle Ricks	1° 🥇	Java language Didn't use AIMA libraries MinMax with alpha-beta pruning & custom evaluation
2019/2020	Colish	2° 🥈	Java language Didn't use AIMA libraries MinMax with alpha-beta pruning
2019/2020	Gotta Train Em All (no repo)	3° 🥉	Boh? :(

2020/2021	brAInmates	1° 🥇	MinMax, alpha-beta cuts and iterative deepening search Simple heuristics Great explaination in PDF
2020/2021	tabloidi	2° 🥈	AIMA libraries + iterative deepening alpha-beta search
2020/2021	THOR	3° 🥉	Java Language (+ Python attempt) MinMax with alpha-beta pruning (no AIMA libraries) Iterative deepening BitState as data structure Parallelization: first level is explored in parallel

Provide feedback