In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several ...

Monte Carlo Tree Search is a simple, yet powerful search heauristic commly used to implement game playing AIs. In it's most basic form, MCTS can effectivly play any discrete, deterministic, perfect ...