Hi,
after thinking over your advices in the previous thread and making some
investigation I have figured out two options of working on the hardware
accelerator. One is to develop a totaly new algorithm that fits for a hardware
acceleration better than current ones. Or to find what can be improved in
current algorithms moreorless revolutionary, because just acceleration of an
algorithm part is not a solution,
I thought that maybe it will be interesting to improve pattern matching.
Current programs can massively match relatively small patterns. Hardware may
have the following parametres:
- pattern size up to 9x9 with wildcards ("does not matter" field state to
eleminate influence of insignificant peripheral stones' positions);
- additional attributes as usual (liberties, ko, distance to an edge)
- internal position calculator with pattern extractor (just send a cell
position and receive its belonging to a pattren back)
- several patterns' evaluation at a time (should further specify how much)
- about 30000 7*7 patterns in an $200 device
- about 2 microseconds time
Does anyone have an idea will it be valuable?
Dmitry
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
