The game of Hex, n-dimensional chessboard and Fixed Point Theorem

Abstract The main result of this paper is the algorithmic proof of n-dimensional Steinhaus’ chessboard theorem (as formulated in [12]). Our theorem implies Poincar´e Theorem [8] [7] which is equivalent to the Brouwer Fixed-Point Theorem