| [ QuizWit ] in KIDS 글 쓴 이(By): guest (OTiS) 날 짜 (Date): 1998년02월19일(목) 05시03분15초 ROK 제 목(Title): Go SToP II . I thought about implementing the best go-stop simulation. The problem with go-stop or any other card game is that the decision making process is not deterministic but rather probabilistic. The best way to implemment go-stop in computer program is regarding ADT as a graph with 52 vertices. ( i think there 52 pae in gostop but if i am wrong plese correct me.) Consider the state space as a set of such graphs). For instance Go-go-ri cards ( total 3 cards) will be connected with edge with each edge valued 1 but when 3 vertices form a cycle, the weight increases. Then the object of this graph simulation is to form as many cycle as we want. When other player take some cards, the vertices corresponding to these cards will be deleted. ( or you can give 51 edges connecting to that vertex zero value.) |