{"content":{"sharePage":{"page":0,"digests":[{"id":"80995463","dateCreated":"1490499125","smartDate":"Mar 25, 2017","userCreated":{"username":"jwes","url":"https:\/\/www.wikispaces.com\/user\/view\/jwes","imageUrl":"https:\/\/www.wikispaces.com\/i\/user_none_lg.jpg"},"monitored":false,"locked":false,"links":{"self":"https:\/\/chessprogramming.wikispaces.com\/share\/view\/80995463"},"dateDigested":1531477974,"startDate":null,"sharedType":"discussion","title":"Dispersion and Distortion","description":"The example code does not seem to work if there are not pawns on each file, e.g.
\nwhite pawns
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n1 . . . . 1 . .
\n. . . . . . 1 .
\n. 1 . . . . . 1
\n. . . . . . . .
\n
\nrearFill
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n1 . . . . 1 . .
\n1 . . . . 1 1 .
\n1 1 . . . 1 1 1
\n1 1 . . . 1 1 1
\n
\nrearFill xor (rearFill << 1) & ~A-File
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n. . . . . . . .
\n. 1 . . . 1 1 .
\n. 1 . . . 1 . 1
\n. . 1 . . 1 . .
\n. . 1 . . 1 . .","replyPages":[{"page":0,"digests":[{"id":"93523911","body":"Oups, sorry. I should not reply in a hurry early in the morning. I confused the mapping. The << 1 is correct of course. The idea is to count the rank difference between the most advanced file-adjacent pawns of two files as a Distortion penalty - in case of half-isolated pawns the penanlty is the greater the more advanced the half isolani is - whatever it is worth.","dateCreated":"1490556490","smartDate":"Mar 26, 2017","userCreated":{"username":"GerdIsenberg","url":"https:\/\/www.wikispaces.com\/user\/view\/GerdIsenberg","imageUrl":"https:\/\/www.wikispaces.com\/user\/pic\/1202793136\/GerdIsenberg-lg.jpg"}}],"more":0}]}],"more":false},"comments":[]},"http":{"code":200,"status":"OK"},"redirectUrl":null,"javascript":null,"notices":{"warning":[],"error":[],"info":[],"success":[]}}