So I played around with this last night incorporating the pending @inbounds macro and using the profiler. My modified code runs in about 9.2s, which is 1.7x gcc -O0 and 4.8x gcc -O3. It's also more than 2x faster than the original Julia code.
One interesting note was the apparent slowness of mod, as shown in the profiling results below:

635 ...pbox/go.jl; ...dditional_liberty; line: 123
191 ...pbox/go.jl; ...dditional_liberty; line: 124

Where lines 123 and 124 correspond to:

ai = 1 + mod(pos - 1, board.size)
aj = 1 + fld(pos - 1, board.size)

I guess I wouldn't expect mod to be that much slower than fld (I ran the profiler a few times just to check it wasn't a sampling thing).

Gist of my modified code: https://gist.github.com/karbarcca/5815251

Game of GO benchmark #1169

Description

Metadata

Assignees

Labels

Type

Projects

Milestone

Relationships

Development

Issue actions