Modules:

  * Video: grabbing still frames from a video file / stream. Planning to use FFmpeg.

  * Graphic: extracting game position from an image. Using Pillow.

  * Watcher: interpreting sequence of game positions as a sequence of moves.

  * Broadcaster: interfacing with a go server.

Graphic

-------

Interpolating the board grid from specified corner points.

Determining the point status based on majority voting of pixels in its neighbourhood (deciding by HSI intensity). Could be improved by considering saturation. Other methods could be better. Opened to research.

    * reachable from any past state. (Incorrect states inbetween). How to pick the correct leaf of such a tree?

    * reachable by more than one move. Issues with branching factor.

  * board shifts -> repaired manually (or automatically), further positions have to be reevaluated

  * stone shifts

    * stone stops being recognized -> fixable manually and even ignorable

    * stone is recognized at an empty intersection. It can be occupied later for real. What do?

    a,b,c,d=[c.toProjective() for c in corners.corners]

    p1=numpy.cross(a,b)

    p2=numpy.cross(c,d)

    vanish1=numpy.cross(p1,p2)

    # !! 32 bit int can overflow. keeping it reasonably small. might want to use a cleaner solution

    p3=numpy.cross(a,d)

    p4=numpy.cross(b,c)

    vanish2=numpy.cross(p3,p4)

    vanish2=EPoint.fromProjective(vanish2).toProjective()