Chess boards & connections.

Trying to calculate if I can write a Chess AI.

I need to define all possible boards.

I have a total of 64 different pieces, 16 for Black
and 16 for White to start, and since each pawn
can be promoted, to either a Queen or Knight, a
further 16 for B&W's 8 pawns for another 32.

There are 65 locations on the board, 8*8 + 1 for
non-existance called the side bar.

So I dimension an Array, (64,65) where the 64
provides the *serial number* for all possible
pieces and each of those can be in 65 locations,
providing 64*65=4160 boards.
(I'll skip using exclusion right now, like two pieces
can't occupy the same square, but all that means
is there are < 4160 possible boards).

To get the number of connections between N boards,
I use C=N*(N-1)/2 = 8,650,720 , (N=4160), most of
which are impossible and can be excluded, in any
case C is not a high number relative to computer
memory today.

The problem has no ambiguity, all the boards and
connections define all possible games.
(I recall from biology, a fly brain has about 8,000,000
neuronic connections, to scale the intelligence, you
know, flying around navigating, finding ***).

A question arises, White moves first, does that mean
the same perfect algorithm will result in White winning,
loosing, or always a draw?
Regards
Ken S. Tucker

.