object
Strategies
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
_alphabeta[G, S, O, M, MS, MM, N](game: G, state: S, depth: Int, cutoff: Map[Player, N], heuristic: (S) ⇒ Map[Player, N])(implicit arg0: Order[N], evGame: Game[G, S, O, M, MS, MM]): (M, Map[Player, N])
-
def
aiMover[G, S, O, M, MS, MM, N](lookahead: Int, heuristic: (S) ⇒ Map[Player, N])(implicit arg0: Order[N], evGame: Game[G, S, O, M, MS, MM]): (G, S) ⇒ Distribution0[M, Rational]
-
def
alphabeta[G, S, O, M, MS, MM, N](game: G, state: S, depth: Int, heuristic: (S) ⇒ Map[Player, N])(implicit arg0: Order[N], evGame: Game[G, S, O, M, MS, MM]): (M, Map[Player, N])
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
implicit
val
distDouble: Dist[Rational]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hardCodedStringStrategy[G, S, O, M, MS, MM](input: (G, MS) ⇒ String)(implicit evGame: Game[G, S, O, M, MS, MM], evGameIO: GameIO[G, O, M, MS, MM]): (G, MS) ⇒ Distribution0[M, Rational]
-
def
hashCode(): Int
-
def
interactiveMove[G, S, O, M, MS, MM](implicit evGame: Game[G, S, O, M, MS, MM], evGameIO: GameIO[G, O, M, MS, MM]): (G, MS) ⇒ Distribution0[M, Rational]
-
final
def
isInstanceOf[T0]: Boolean
-
def
minimax[G, S, O, M, MS, MM, N](game: G, state: S, depth: Int, heuristic: (S) ⇒ Map[Player, N])(implicit arg0: Order[N], evGame: Game[G, S, O, M, MS, MM]): (M, S, Map[Player, N])
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
outcomeRingHeuristic[G, S, O, M, MS, MM, N](game: G, f: (O, Player) ⇒ N)(implicit arg0: Ring[N], evGame: Game[G, S, O, M, MS, MM]): (S) ⇒ Map[Player, N]
-
def
randomMove[G, S, O, M, MS, MM](implicit evGame: Game[G, S, O, M, MS, MM]): (G, MS) ⇒ Distribution0[M, Rational]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
userInputStream(display: (String) ⇒ Unit, read: () ⇒ String): Stream[String]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit