65 	int	k, n, pid, ret, rpid, t;  in main()  local
182 	for(k = 0; k < n; k++){  in main()
183 		if(0 <= go[k] && go[k] <= 24)  in main()
186 			fprintf(stdout, "Move %d illegal.\n", go[k]);  in main()
208 	int	k, n, die, ipos;  local
210 	for(k=0; k < player[0]; k++){  /*blots on player[0] must be moved first*/
211 		if(pos[k] == NIL)
213 		if(pos[k] != 0){
218 	for(k = 0; (ipos=pos[k]) != NIL; k++){
219 		die = k?die2:die1;
234 	for(k = 0; pos[k] != NIL; k++){
235 		die = k?die2:die1;
236 		n = 25-pos[k]-die;
246 	while(k--){
247 		die=k?die2:die1;
248 		player[pos[k]]++;
249 		player[pos[k]+die]--;
256 	int	k;  local
261 		k=die1;
263 		die2=k;
270 	k=strategy(player,playee);		/*select kth possible move*/
271 	prtmov(k);
272 	update(player,playee,k);
275 prtmov(k)  in prtmov()  argument
276 int k;  in prtmov()
280 	if(k == NIL)
283 		if(moves[k].pos[n] == NIL)
285 		fprintf(stdout, "    %d, %d",25-moves[k].pos[n],moves[k].mov[n]);
289 update(player,playee,k)  in update()  argument
290 int *player,*playee,k;  in update()
295 		if(moves[k].pos[n] == NIL)
297 		player[moves[k].pos[n]]--;
298 		player[moves[k].pos[n]+moves[k].mov[n]]++;
299 		t=25-moves[k].pos[n]-moves[k].mov[n];
353 	int	k;  local
359 		if((k=25-i-die1) > 0 && movee[k] >= 2)
364 		if(k <= 0){
376 			if((k=25-j-die2) > 0 && movee[k] >= 2)
381 			if(k <= 0){
400 				if((k=25-l-die1) > 0 && movee[k] >= 2)
405 				if(k <= 0){
417 					if((k=25-m-die1) >= 0 && movee[k] >= 2)
422 					if(k <= 0){
511 	int	k, n, nn, bestval, moveval, prob;  local
518 	for(k = 0; k < imoves; k++){
519 		if((moveval=eval(player,playee,k,&prob)) < bestval)
526 			goodmoves[n]=k;
534 		for(k = 0; k < nn; k++){
535 			if((moveval=probmoves[k]) > prob)
541 			goodmoves[n]=goodmoves[k];
542 			probmoves[n++]=probmoves[k];
548 eval(player,playee,k,prob)  in eval()  argument
549 int *player,*playee,k,*prob;  in eval()
566 		if(moves[k].pos[n] == NIL)
568 		newtry[moves[k].pos[n]]--;
569 		newtry[ii=moves[k].pos[n]+moves[k].mov[n]]++;
640 	int	k, n, sum;  local
645 			for(k = 1; k <= 12; k++){
646 				if((n=25-start-k) < 0)
649 					sum += probability[k];
657 	int	k;  in prtbrd()  local
661 	for(k = 1; k <= 6; k++)  in prtbrd()
662 		fprintf(stdout, "%4d",k);  in prtbrd()
664 	for(k = 7; k <= 12; k++)  in prtbrd()
665 		fprintf(stdout, "%4d",k);   in prtbrd()
691 	for(k = 24; k >= 19; k--)  in prtbrd()
692 		fprintf(stdout, "%4d",k);  in prtbrd()
694 	for(k = 18; k >= 13; k--)  in prtbrd()
695 		fprintf(stdout, "%4d",k);  in prtbrd()
701 	int	k, n;  local
703 	for(k = start; k <= fin; k++){
704 		if((n = upcol[k]) != 0 || (n = downcol[25-k]) != 0)
714 	int	k;  local
717 	for(k = start; k <= fin; k++){
719 		if(upcol[k] != 0)
721 		if(downcol[25-k] != 0)