{"content":{"sharePage":{"page":0,"digests":[{"id":"1450993","dateCreated":"1193471186","smartDate":"Oct 27, 2007","userCreated":{"username":"MarkLefler","url":"https:\/\/www.wikispaces.com\/user\/view\/MarkLefler","imageUrl":"https:\/\/www.wikispaces.com\/i\/user_none_lg.jpg"},"monitored":false,"locked":false,"links":{"self":"https:\/\/chessprogramming.wikispaces.com\/share\/view\/1450993"},"dateDigested":1531474265,"startDate":null,"sharedType":"discussion","title":"section expansion","description":"I think each one of the evaluation terms could use a lot of expansion, and its own page. maybe we could use Fruit 2.1 terms as examples, since it is both strong, and avaulable to everyone.","replyPages":[{"page":0,"digests":[{"id":"23878411","body":"
\nyou know i just finished writing my first evaluation function (december 2009) - and i would not have been able to do it using the information here - which seems to assume a great deal of mathematical knowledge. i had to work my negamax function by trial and error - and nowhere did anyone give me a good example that told me i had to score the RESULT of the move, and not the move in isolation - obvious - duh - if you've already done it - yes, but not if you read this section. so i just added some beginner info which, as a beginner chess programmer - would have saved me several weeks of hacking it out with my own research. hope it helps someone out there doing the same. :-)
\n
\nall the best from toronto island.
\n
\n
\ncheck out pChess (with FutureBasic 5 source code included):
\nhttp:\/\/home.earthlink.net\/~johnrpenner\/index-creative.html<\/a>","dateCreated":"1273262426","smartDate":"May 7, 2010","userCreated":{"username":"johnrpenner","url":"https:\/\/www.wikispaces.com\/user\/view\/johnrpenner","imageUrl":"https:\/\/www.wikispaces.com\/user\/pic\/1270587917\/johnrpenner-lg.jpg"}}],"more":0}]}],"more":false},"comments":[]},"http":{"code":200,"status":"OK"},"redirectUrl":null,"javascript":null,"notices":{"warning":[],"error":[],"info":[],"success":[]}}