build/ludorum.js
/** In this view of the game the hidden information is modelled as random variables. The 
	aleatory that is returned ranges over all possible piece sets that the opponent of the given
	`player` may have. After each possibility the assumption is maintained for the rest of the
	game.
	
	This allows to model the uncertainty that each player has about its opponent's pieces. By doing
	so an artificial player that searches the game space cannot infer the pieces the opponent has,
	and hence it cannot cheat.
	*/
In this view of the game the hidden information is modelled as random variables. The
aleatory that is returned ranges over all possible piece sets that the opponent of the given
`player` may have. After each possibility the assumption is maintained for the rest of the
game.

This allows to model the uncertainty that each player has about its opponent's pieces. By doing
so an artificial player that searches the game space cannot infer the pieces the opponent has,
and hence it cannot cheat.
In this view of the game the hidden information is modelled as random variables . The aleatory that is returned ranges over all possible piece sets that the opponent of the given ` player ` may have . After each possibility the assumption is maintained for the rest of the game . This allows to model the uncertainty that each player has about its opponent ' s pieces . By doing so an artificial player that searches the game space cannot infer the pieces the opponent has and hence it cannot cheat .
function view(player) {
		return new this.constructor({
			pieces: obj(player, this.pieces[player]), 
			playedPieces: this.playedPieces,
			scores: this.__scores__
		});
	}
function view ( player ) { return new this . constructor ( { pieces : obj ( player , this . pieces [ player ] ) , playedPieces : this . playedPieces , scores : this . __scores__ } ) ; }
In this view of the game the hidden information is modelled as random variables.
In this view of the game the hidden information is modelled as random variables .