Re: lets wrap this up.
this is the work i did get done:
the results are in!!!!!!!!!!!!!!!!!!!!!
here is the accumulation of 6 hours of tedious work: (WARNING: THIS WILL GET
VERY COMPLICATED. NOT FOR THE ILL-MINDED)
so i first decided to settle the debates on the rules. to take the original context, the players are "playing at their best". this most certainly does not mean they must take a pawn whenever available. some of the best plays you can make ignore oppertunities. i, being a programer and a chess fanatic, knew the most efficient way of dealing with chess problems: to use the game tree. for those who do not know what this is, it is an accounting of every possible move that can be taken. every possible outcome is aceived. this is how computers always beat you in chess. checkers, tictacto, and most any other turn-based game, too. then i decided that, if a pawn were to get to the opposite side, it would be a win. for, by the rules of chess, if a pawn got to the opposing side of the chess board, it would turn into any peice not on the board. if the player was truely playing at their best, they would get a queen and massacre the board. finaly, en passants are impossible, because it is impossible for a pawn to move 2 spaces at the start, thus the very thing the en passant refers to is non-existant, thus making it non-existant. so, therefore, the debate is settled: a peice on the opposing side is a win. also, i included any way possible, so stupid mistakes are recorded in the game tree provided. next, i started on my 3-page-long game tree that took most of the 6 hours i spent on this problem.
now, before i get to the game tree, i would like to demonstrate a few things. first, the syntax used. "p", when refering to a move, means a pawn moved. "W" or "B" denotes the color of the pawn. the subsequent number refers to the pawn's number (1, 2, or 3). the pawns are numbered as folows:
Code:
--------------------------
| pB1 | pB2 | pB3 |
--------------------------
| | | |
--------------------------
| pW1 | pW2 | pW3|
--------------------------
after specifying what peice i am refering to, i write the movements of the peice. the movements are shown by how many spaces up the unit moved, and how many spaces right the unit moves. and, to prevent future questions, yes, that does mean a downward move is a negetive number, and likewise with a left move. they are written similar to an ordered pair, exept the "y" coordinate, or the movement up or down, is first. also, if a pawn takes another pawn, it is refered to after the move is stated. so, the end product looks something like this:
Code:
pW1(1,-1)pB2
pB3(-1,1)pW3[B]
pW2(1)D
the first one reads: "white pawn 1 moves up 1 and left one, taking black pawn 2"
the seccond one reads: "black pawn 3 moves down 1 and right 1, taking white pawn 2 and winning the game for black"
the third one reads: "white pawn 2 moves up 1, causeing a draw"
so, yes, when the pawn only moves up or down, the seccond move coordinate is excluded, since it would be "0".
on to the game trees:
(by the way, i recomend having a chessboard of some kind in front of you. i drew one and used 3 quarters and 3 nickels.)
Code:
first moves
--------------
|
|---------------|----------------------------------------|
| | |
pW1(1) pW2(1) pW3(1)
| | |
|-| |------------ | |---------------------|-----------------|
| | | pB2(-1)
| | pB1(-1) |
| | | |-----------------|-------------------------------|
| | |-------------------------|----------------------------------| | |
| | pW2(1,-1)pB1 pW3(1,-1)pB2[W] pW2(1) pW1(1)[D] pW1(1,1)pB2
| | | | |
| | |--------------------------|------------------------| |------------|------------------------| |-------------|------------------------|
| | | | | pB(-1,1)pW3 pB(-1,-1)pW2 pB1(-1,1)pW1[D] |
| | pB2(-1) pB2(-1,1)pW3[D] pB2(-1,-1)pW1 | | |
| | | | |---|--------| |----------|-----------|-------| |
| | |---------------| pW2(1)[W] | | | | | |
| | | | pW2(1)[W] pW2(1,1)pB3[W] pW3(1)[W] | pW3(1,-1)pB3[W] |
| | pW2(1)[W] pW1(1,1)pB2 pW1(1,1)pB3 |
| | | | |
| | pB3(-1,-1)pW2 |-------------------------|------------------------------------------------------------| |------------|
| | | pB2(-1,1)pW3 pB1(-1)[B] |
| | |----------------| | |---------------------------------------------|------|
| | pW1(1)[W] pW3(1)[W] pW2(1)[W] pB1(-1) pB3(-1,-1)pW1
| | | |
| | |---------------------------|----------------------------------------------------------| pW3(1)[W]
| | pW2(1,-1)pB1 pW1(1,1)pB3[W] pW(1)[W]
| | |
| | pB3(-1,-1)pW2
| | |
| | |-----------------|
| | | |
| | pW3(1)[W] pW1(1)[W]
| |
| |----------------------------------|---------------------------|-------------------------------------|------------------------------------------------------------|
| pB1(-1) pB1(-1,1)pW2 pB3(-1,-1)pW2
| | | |
| |---------------------| |-----------------|
| | | | |
| pW3(1) pW2(1,1)pB3[W] pW1(1,1)pB1 |
| | | |------------------------------------------------------------------|
| |---------|------------------| |-----------------------------------------| |
| | | | | |
| pB2(-1,1)pW3 pB3(-1,-1)pW2 pB3(-1)[D] pB3(-1,-1)pW1 |
| | | | |
| |---------------------| |------------------------|----------------------|---------------------| |---------------------| |
| | | | | | | |
| pW2(1)[W] pW2(1,1)pB3[W] pW1(1,1)pB3 pW3(1)[W] pW3(1,-1)pB2[W] | |
| | | |
| |-------------------------| |-------------------------------------| |
| | | | | |
| pB2(-1,1)pW3 pB1(-1)[B] pW3(1) pW3(-1,-1)pB3[D] |
| | | |
| pW2(1)[W] |-----------------------------| |---------------------------------|
| pB2(-1,-1)[B] pB3(-1)[W] pW1(1) |
| | |
| |-------------------------------|-----------------------------|--------------------------| |
| pB3(-1) pB1(-1)[B] pB2(-1,-1)pW1 pB1(-1,1)pW3[B] |
| | | |
| |-------------|--------------|---------------------------| |-------------------| |
| | | | pW3(1) pW3(1,-1)pB1 |
| pW1(1,1)pB2[W] pW1(1)[W] | | |------------|--------| |
| | |-------------| | | |
| |--------------------------------------------------------| pB1(-1)[B] pB2(-1)[B] | pB2(-1)[B] |
| | pB3(-1,-1)pW3[B] |
| pW3(1,-1)pB1 |
| | |---------------------------------------------------------------------------------------|
| |------------------| pW3(1) pW3(1,-1)pB1
| | | | |--------------------|
| pB3(-1)[B] pB2(-1,-1)pW1 |----------------------|--------------------| pB3(-1) pB3(-1,-1)
| | pB(-1)[B] pB1(-1,-1)pW1[B] pB2(-1,1)pW3 |
| pW3(1)[W] | pW1(1)
| |-------------------------------------------| |
| pW1(1) pW1(1,1)pB1 |--------------|
| |------------------------------| | pB3(-1)[B] pB3(-1,-1)pW1
| pB1(-1)[B] pB2(-1)[B] |-----------------------| |
| pB2(-1)[B] pB3(-1,-1)pW1[W] |-------------|