Hi Matthew,
Let me try to show you the point: "Put the following diagram in your computer. If it has an endgamebook, turn it off."
Tell me what is the evaluation?
Also computers favor white at checkers because off the first move. Checkers is proven to be a draw 
). That doesn't mean you can't aim to be (of course hardly any of us achieve such aims).
Matthew, do you realize what you're doing? You're twelve years old and you're debating basic applications of computer science and mathematics with adults who have considerable experience in these fields. I'm glad to see that you've moved past that circular "computers programmed by humans say that white will win, so humans must now trust computers and accept that white will win" argument, but a rudimentary grasp of statistics won't help you either. While it is not impossible that white's first move advantage can convert into a forced win, there is nothing you can do to prove it either way. Trust me. It's better to say "I don't know" than to make erroneous arguments.
Did you try those things that I asked you to do? That is, did you compare computer analysis on the lines "1. e4 e5" and "1. e3 e5 2. e4" (or a similar line where white surrenders tempo to black)? Analysis at lower depths should be more revealing. And did you try to pit a computer against itself to see if it could convert that opening advantage each time? After all, if the computer has a winning advantage from the start, it should keep on winning, right?
Here's another fun experiment: start with a regular chess board, and determine the numerical advantage with an engine. Remove the a-pawns from both sides, then determine the advantage again. Then remove the b-pawns and do the same. Keep doing this until you are left with kings only (a dead draw). How does the advantage evolve with the removal of each piece? You can keep experimenting by starting over and removing the pieces in a different order.