Unless you&#39;re dealing with a board with millions of positions or more, sparse matrices don&#39;t matter. <div><br></div><div>The array package has support for 2d arrays. </div><div><br></div><div>I&#39;ve my own pretty fancy multi dim array tooling in the works, but for your use case just use array package <span></span><br>
<br>On Friday, June 20, 2014, Chris Warburton &lt;<a href="mailto:chriswarbo@googlemail.com">chriswarbo@googlemail.com</a>&gt; wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Corentin Dupont &lt;<a href="javascript:;" onclick="_e(event, &#39;cvml&#39;, &#39;corentin.dupont@gmail.com&#39;)">corentin.dupont@gmail.com</a>&gt; writes:<br>
<br>
&gt; Instead of encoding the board, I would encode the position of the pieces:<br>
&gt; there is usually much less pieces than squares.<br>
<br>
Possibly useful: <a href="http://en.wikipedia.org/wiki/Sparse_matrix" target="_blank">http://en.wikipedia.org/wiki/Sparse_matrix</a><br>
<br>
Cheers,<br>
Chris<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="javascript:;" onclick="_e(event, &#39;cvml&#39;, &#39;Haskell-Cafe@haskell.org&#39;)">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</blockquote></div>