[computer-go] State of the art of pattern matching

[Mark Boon]

On 29-mrt-08, at 10:47, Jacques Basaldúa wrote:

> I don't use don't care. I mask code in 2 bits: void, own,
> opponent, out_of_board. This produces bigger database size,
> because the only way to introduce "don't care" is to repeat the
> pattern.

OK, so we were comparing apples and oranges. I know that using a hash- 
code with fixed-size patterns is a whole lot faster. You don't need  
to revert to assembler to make that really fast. If you see my  
original message you'll see that I mentioned that. I was specifically  
asking about a pattern-matcher that allows for don't-care points  
because I think I need that.

It's possible that speed considerations will make it necessary to use  
this kind of fixed-size patterns. I'm not yet convinced of it, but I  
don't rule out the possibility either. But before turning to the dark  
side I'd prefer to first explore how far (and fast) I can get with a  
'traditional' pattern-matcher that allows for don't care points.

Mark



-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20080329/44b61c26/attachment.htm