When I started I used this as well. However when I realized how many times I would be looking at all adjacent intersections I switched to having an array adjacent[BOARD_SIZE * BOARD_SIZE][5]. In addition to making the code cleaner, this allows for more compact code size and (I think) more predictable branches. It also slightly reduces the memory footprint by taking away the borders. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
- [computer-go] Go datastructures Joshua Shriver
- Re: [computer-go] Go datastructures Sanghyeon Seo
- Re: [computer-go] Go datastructures Zach Wegner
- Re: [computer-go] Go datastructures Ray Tayek
- Re: [computer-go] Go datastructures Zach Wegner
- Fast data structures explained! (was Re: [computer... Peter Drake
- Re: Fast data structures explained! (was Re: [... Jason House
- Re: Fast data structures explained! (was R... Peter Drake
- Re: Fast data structures explained! (w... Jason House
- Re: Fast data structures explaine... Peter Drake
- Re: Fast data structures expl... Jason House
- Re: Fast data structures ... Peter Drake
- Re: Fast data structures expl... Richard J. Lorentz
- Re: Fast data structures ... Peter Drake
- Re: Fast data structures explaine... Ian Osgood