Then, time permitting, we will discuss ideas for the Hat Guessing Game on K n,n,n. The Hat Guessing Game is as follows: There are n bears and one demon (who can read the bears' minds), and the bears ...

the vertex is a maximum turning point We can identify these properties from a quadratics graph or equation.