Thread: Complex Formula View Single Post
 04-15-2003, 04:43 AM PM User | #12 mattover-matter Banned   Join Date: Mar 2003 Posts: 224 Thanks: 0 Thanked 0 Times in 0 Posts ok, im going to restate: My question: I wish to figure out how many valid positions in a chess game are possible (at one time) My troubles: 1) two peices cannot be on the same square at one time 2) bishops cannot reach every square on the board 3) pawns cannot reach every square on the board (cannot move backwards) 4) Whenever a pawn reaches the end, It can choose a peice that is already dead (from his side) and revive it inplace of the pawn. You cannot have 2 queens, or 3 rooks. 5) Units cannot travel through (you must think back). A pawn cannot appear behind an enemy pawn for some reason (well, it is possible but not if the pawns have not killed anyone) FYI: 1) There are 64 squares on a chessboard. 2) There are 8 pawns, 2 rooks, 2 knights, 2 bishops, 1 queen, 1 king per side(32 in total) 3) The dimensions for a chessboard are 8x8. 4) A knight CAN reach every position on the board. Also, I asked at DR.math forum to see if anyone there knows a solution. re: It would be interesting to know, but probably not fun to do You are missing the point of this. Do you think I randomly pick things that have 0 relevency in anything I will ever do (don't take me literally)? I am doing this to learn, not to know. knowing is just a bonus. (note : what I just said applies to this problem, and this problem only [again, don't take me literally])