Package kakuro.table

Examples of kakuro.table.Position

91
92
93
94
95
96
97
98
99
    _difficulty = skeleton.getDifficulty();
    _blacks.clear();
    _fields.clear();
    for (int i=0; i<_x; i++)
      for (int j=0; j<_y; j++)
        if (skeleton.getType(new Position(i, j))==ISkeletonTable.CELL_BLACK)
          _blacks.put(new Position(i, j), true);
    redraw();
  }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
    GridLayout layout = new GridLayout(_y, _x, 1, 1);
    setLayout(layout);
   
    for (int j = 0; j < _y; j++) {
      for (int i = 0; i < _x; i++) {
        Position pos = new Position(i, j);
        SkellyField f = new SkellyField(pos, _blacks.containsKey(pos));
        add(f);
        _fields.put(pos, f);
      }
    }
    for (int j = 0; j < _y; j++) {
      for (int i = 0; i < _x; i++) {
        Position pos = new Position(i, j);
        checkLongs(pos);
      }
    }
    validate();
    repaint();
View Full Code Here
130
131
132
133
134
135
136
137
138
   * @param p kiindulási pozíció
   * */
  protected void checkLongs(Position p) {
        for (int i=0; i<_x; i++) {
              for (int j=0; j<_y; j++) {
                    if (i==p.x || j==p.y) checkLongs2(new Position(i, j));
              }
        }
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
  protected void checkLongs2(Position pos) {
        if (_blacks.containsKey(pos)) {
              _fields.get(pos).setProblematic(false);
              return;
        }
        Position p;
        int horizontalCount = 1;
        for (int i=pos.x-1; i>=0; i--) {
              p = new Position(i, pos.y);
              if (_blacks.containsKey(p)) break;
              horizontalCount++;
        }
        for (int i=pos.x+1; i<_x; i++) {
              p = new Position(i, pos.y);
              if (_blacks.containsKey(p)) break;
              horizontalCount++;
        }
        int verticalCount = 1;
        for (int i=pos.y-1; i>=0; i--) {
              p = new Position(pos.x, i);
              if (_blacks.containsKey(p)) break;
              verticalCount++;
        }
        for (int i=pos.y+1; i<_y; i++) {
              p = new Position(pos.x, i);
              if (_blacks.containsKey(p)) break;
              verticalCount++;
        }
        if (horizontalCount>9 || verticalCount>9) {
              _fields.get(pos).setProblematic(true);
View Full Code Here
379
380
381
382
383
384
385
386
387
388
389
    if (table.getColumnCount()!=skeleton.getColumnCount() || table.getRowCount()!=skeleton.getRowCount())
      throw new IndexOutOfBoundsException("Table size mismatch");
    showValues = true;
    for (int j=0; j<_y; j++) {
      for (int i=0; i<_x; i++) {
        Position p = new Position(i, j);
        SkellyField field = _fields.get(p);
        switch (table.getType(p)) {
          case ITable.BLACK_NONE:  field.setValues(0, 0);  break;
          case ITable.BLACK_BOTH: field.setValues(table.getSum(p, ITable.SUM_HORIZONTAL), table.getSum(p, ITable.SUM_VERTICAL));  break;
          case ITable.BLACK_HORIZONTAL:  field.setValues(table.getSum(p, ITable.SUM_HORIZONTAL), 0);  break;
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
   
    for (int y=0; y<sorokszama; y++) {
      for (int x=0; x<oszlopokszama; x++) {
        positionPriority[x][y]=0;
        positionValues[x][y]=0;
        Position actual = new Position(x, y);
        int celltipus = skeleton.getType(actual);
        String tipus = (celltipus==ISkeletonTable.CELL_BLACK?"Fekete":"Feher");
        System.out.println("at ("+x+","+y+"): "+tipus);
       
       
        //  ###   poziciok prioritasanak szamolasa   ###
                
        if ( celltipus == ISkeletonTable.CELL_WHITE){
         
          int x_pos = x;
          boolean whitePos=true;
          int celltipusNext=ISkeletonTable.CELL_BLACK;
          //int celltipusNextBlack=ISkeletonTable.CELL_BLACK;
         
          positionPriority[x][y]++;
         
         
          do{
            x_pos--;
            Position nextPosition = new Position(x_pos, y);
            celltipusNext = skeleton.getType(nextPosition);
            if( celltipusNext == ISkeletonTable.CELL_WHITE )
              positionPriority[x][y]++;
            else
              whitePos = false;
          }while( whitePos == true );
         
          // ### vizszintes +   ###
          x_pos = x;
            do{
              while ( x_pos < (oszlopokszama-1) ){
                x_pos++;
                Position nextPosition = new Position(x_pos, y);
                celltipusNext = skeleton.getType(nextPosition);
                if( celltipusNext == ISkeletonTable.CELL_WHITE )
                  positionPriority[x][y]++;
                else
                  whitePos = false;
               
                if( x_pos < (oszlopokszama-1) ){
                  Position nextBlackPosition = new Position(x_pos+1, y);
                  int celltipusNextBlack = skeleton.getType(nextBlackPosition);
                  if( celltipusNextBlack == ISkeletonTable.CELL_BLACK)
                    break; 
                }
                if( x_pos == (oszlopokszama-1))
                  break;
              } 
            }while( whitePos == true );
           
            //   ### vizszintes -   ###
            x_pos=x;
            do{
              x_pos--;
              Position nextPosition = new Position(x_pos, y);
              celltipusNext = skeleton.getType(nextPosition);
              if( celltipusNext == ISkeletonTable.CELL_WHITE )
                positionPriority[x][y]++;
              else
                whitePos = false;
            }while( whitePos == true );
           
            //   ### fuggoleges +   ###
            int y_pos = y;
              do{
                while ( y_pos < (sorokszama-1) ){
                  y_pos++;
                  Position nextPosition = new Position(x, y_pos);
                  celltipusNext = skeleton.getType(nextPosition);
                  if( celltipusNext == ISkeletonTable.CELL_WHITE )
                    positionPriority[x][y]++;
                  else
                    whitePos = false;
                 
                  if( y_pos < (sorokszama-1) ){
                    Position nextBlackPosition = new Position(x, y_pos);
                    int celltipusNextBlack = skeleton.getType(nextBlackPosition);
                    if( celltipusNextBlack == ISkeletonTable.CELL_BLACK)
                      break; 
                  }
                  if( y_pos == (sorokszama-1))
                    break;
                }
              }while( whitePos == true );
         
              //   ### fuggoleges
              y_pos=y;
              do{
                y_pos--;
                Position nextPosition = new Position(x, y_pos);
                celltipusNext = skeleton.getType(nextPosition);
                if( celltipusNext == ISkeletonTable.CELL_WHITE )
                  positionPriority[x][y]++;
                else
                  whitePos = false;
              }while( whitePos == true );
        }
        System.out.println(" vizszintes prio szam: "+ positionPriority[x][y]);
       
        // a poziciok ertekkel valo feltoltese
       
        int i_pos, j_pos;
        for( int prioNumIdx = 16; prioNumIdx >1; prioNumIdx-- ){
          for (int j=0; j<sorokszama; j++) {
            for (int i=0; i<oszlopokszama; i++) {
              if ( positionPriority[i][j] == prioNumIdx ){
                i_pos=i;
                boolean[] values = new boolean[10]; // a lehetseges ertekek
                for ( int v=1; v<10; v++) values[v]= true;
               
                while ( positionPriority[i_pos][j] !=0 ){
                  i_pos++;
                  for (int check=0; check!=10; check++){
                    if( positionValues[i_pos][j]==check)  values[check] = false;
                  }         
                }
               
                i_pos=i;
                while ( positionPriority[i_pos][j] !=0 ){
                  i_pos--;
                  for (int check=0; check!=10; check++){
                    if( positionValues[i_pos][j]==check)  values[check] = false;
                  }         
                }
               
                j_pos=j;
                while ( positionPriority[i][j_pos] !=0 ){
                  j_pos++;
                  for (int check=0; check!=10; check++){
                    if( positionValues[i][j_pos]==check)  values[check] = false;
                  }         
                }
               
                j_pos=j;
                while ( positionPriority[i][j_pos] !=0 ){
                  j_pos--;
                  for (int check=0; check!=10; check++){
                    if( positionValues[i][j_pos]==check)  values[check] = false;
                  }         
                }
               
                int valuesCount=0;
                for (int v=0; v!=10; v++)
                  if ( values[v]==true ) valuesCount++;
               
                Random rand = new Random();
                //int n = 10;
                  //int r = rand.nextInt(n+1);
                  int r = rand.nextInt(valuesCount);
                 
                  int trueIdx=0;
                  int w=1;
                  while( w!=10 ){
                    if( values[w]==true ){
                      trueIdx++;
                      if( trueIdx==r )  positionValues[i][j]=w;
                    }
                    w++;
                  }
              }
              //System.out.println(i+". sor, "+j+". oszlop: "+ positionValues[i][j]);
            }
            //System.out.println(" ###### ");
          }
        }       
      }
    }
   
   
    for (int jdx=0; jdx< sorokszama; jdx++){
      int str[]=new int[oszlopokszama+1];
      for (int idx=0; idx < oszlopokszama; idx++){
        str[idx]=positionValues[idx][jdx];
        //System.out.println(positionValues[idx][jdx]);
      }
      //System.out.println(jdx+". sor: "+str[0]+str[1]+str[2]+str[3]+str[4]+str[5]+str[6]+str[7]+str[8] ); 
    }
   
//  ###########################################
   
    System.out.println("#########################");
   
    Vector<String> wordsInRows = new Vector<String>();
    Vector<String> wordsInColumns = new Vector<String>();
   
    /*for (int x=0; x!=oszlopokszama+1; x++)
      for (int y=0; y!=sorokszama+1; y++)
        positionValues[x][y]=0;*/
   
   
    for (int y=0; y!=sorokszama; y++) {
      for (int x=0; x!=oszlopokszama; x++) {
       
        Position actual = new Position(x, y);
        Position prePosition_X = new Position( x-1 , y );
        Position prePosition_Y = new Position( x , y-1 );
        int celltipus = skeleton.getType(actual);
        int celltipus_pre_X = skeleton.getType(prePosition_X);
        int celltipus_pre_Y = skeleton.getType(prePosition_Y);
        //String tipus = (celltipus==ISkeletonTable.CELL_BLACK?"Fekete":"Feher");
        //System.out.println("at ("+x+","+y+"): "+tipus);
   
       
        if ( celltipus_pre_X == ISkeletonTable.CELL_BLACK && celltipus == ISkeletonTable.CELL_WHITE ){
 
          boolean nextPositionBlack=false;
          int celltipusNext=ISkeletonTable.CELL_BLACK;
          int x_pos = x;                  // ### vizszintes   ###
          do{
              x_pos++;
                if ( x_pos == oszlopokszama){
                  String nextWord= x + "~" + (x_pos-1) + "," + y  ;
                  wordsInRows.add(nextWord);
                  nextPositionBlack = true;
                }else{
                  Position nextPosition = new Position(x_pos, y);
                  celltipusNext = skeleton.getType(nextPosition);
                  if( celltipusNext == ISkeletonTable.CELL_BLACK ) {
                    nextPositionBlack = true;
                    String nextWord= x + "~" + (x_pos-1) + "," + y  ;
                    wordsInRows.add(nextWord);
                    }
                }
            }while( nextPositionBlack != true );
        }
       
        if ( celltipus_pre_Y == ISkeletonTable.CELL_BLACK && celltipus == ISkeletonTable.CELL_WHITE ){
         
          boolean nextPositionBlack=false;
          int celltipusNext=ISkeletonTable.CELL_BLACK;
          int y_pos = y;                  // ### f�gg�leges   ###
          do{
              y_pos++;
                if ( y_pos == sorokszama){
                  String nextWord= x + "," + y + "~" + (y_pos-1) ;
                  wordsInColumns.add(nextWord);
                  nextPositionBlack = true;
                }else{
                  Position nextPosition = new Position(x, y_pos);
                  celltipusNext = skeleton.getType(nextPosition);
                  if( celltipusNext == ISkeletonTable.CELL_BLACK ) {
                    nextPositionBlack = true;
                    String nextWord= x + "," + y + "~" + (y_pos-1) ;
                    wordsInColumns.add(nextWord);
View Full Code Here
219
220
221
222
223
224
225
226
227
228
229
    int cols = Integer.parseInt(s[3]);
    int rows = Integer.parseInt(s[2]);
    HashMap<Position, Boolean> map = new HashMap<Position, Boolean>();
    for (int i=0; i<rows; i++) {
      for (int j=0; j<cols; j++) {
        if (s[4].charAt((i*cols)+j)=='B') map.put(new Position(j, i), true);
      }
    }
    System.out.println("loading "+rs.getInt("TableId"));
    return new SkeletonTableImpl(map, rows, cols, dif, rs.getInt("TableId"));
  }
View Full Code Here
380
381
382
383
384
385
386
387
388
389
390
    String content = "";
    int x = table.getColumnCount();
    int y = table.getRowCount();
    for (int j = 0; j < y; j++) {
      for (int i = 0; i < x; i++) {
        Position pos = new Position(i, j);
        switch (table.getType(pos)) {
        case ITable.BLACK_NONE:
        {
          content = content + "-|-";
          break;
View Full Code Here
446
447
448
449
450
451
452
453
454
455
456
    int difficulty = skeleton.getDifficulty();
    int x = skeleton.getColumnCount();
    int y = skeleton.getRowCount();
    for (int j = 0; j < y; j++) {
      for (int i = 0; i < x; i++) {
        Position pos = new Position(i, j);
        switch (skeleton.getType(pos)) {
        case ISkeletonTable.CELL_BLACK:
        {
          content = content + "B";
          break;
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
  /** Törli a táblát. */
  public void clear() {
    removeAll();
    for (int i = 0; i < _x; i++) {
      for (int j = 0; j < _y; j++) {
        add(new GamefieldNone(_gui, this, i + "," + j, new Position(i,
            j)));
      }
    }
    validate();
  }
View Full Code Here
TOP

Related Classes of kakuro.table.Position

  • kakuro.gui.editor.SkeletonPanel
  • kakuro.gui.GamefieldWhite
  • kakuro.gui.Gametable
  • kakuro.server.Server
  • kakuro.server.tablefactory.BipartiteTableFactory
  • kakuro.server.tablefactory.GeneralTable
  • kakuro.server.tablefactory.GeneralTableFactory
  • kakuro.server.tablefactory.SkeletonGenerator
  • kakuro.server.tablefactory.SkeletonGenerator$MySkeletonImpl
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.