public List < int [ ] > split ( int depth ) { int [ ] choices = new int [ depth ] ; List < int [ ] > result = new ArrayList < int [ ] > ( 100000 ) ; searchPrefixes ( depth , choices , result ) ; return result ; }
Generate a list of row choices to cover the first moves .