Auto Topic: rows
auto_rows | topic
Coverage Score
1
Mentioned Chunks
63
Mentioned Docs
16
Required Dimensions
definitionpros_cons
Covered Dimensions
definitionpros_cons
Keywords
rows
Relations
| Source | Type | Target | W |
|---|---|---|---|
| Auto Topic: row | CO_OCCURS | Auto Topic: rows | 39 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: self | 37 |
| Auto Topic: cols | CO_OCCURS | Auto Topic: rows | 37 |
| Auto Topic: def | CO_OCCURS | Auto Topic: rows | 36 |
| Auto Topic: col | CO_OCCURS | Auto Topic: rows | 20 |
| Auto Topic: perform_move | CO_OCCURS | Auto Topic: rows | 16 |
| Auto Topic: get_board | CO_OCCURS | Auto Topic: rows | 13 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: vertical | 11 |
| Auto Topic: copy | CO_OCCURS | Auto Topic: rows | 11 |
| Auto Topic: len | CO_OCCURS | Auto Topic: rows | 11 |
| Auto Topic: rows | CO_OCCURS | Constraint Satisfaction Problem | 9 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: valueerror | 9 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: tkinter | 9 |
| Auto Topic: raise | CO_OCCURS | Auto Topic: rows | 9 |
| Auto Topic: int | CO_OCCURS | Auto Topic: rows | 9 |
| Auto Topic: padx | CO_OCCURS | Auto Topic: rows | 8 |
| Auto Topic: dominoesgame | CO_OCCURS | Auto Topic: rows | 8 |
| Auto Topic: pack | CO_OCCURS | Auto Topic: rows | 7 |
| Auto Topic: is_legal_move | CO_OCCURS | Auto Topic: rows | 7 |
| Auto Topic: legal_moves | CO_OCCURS | Auto Topic: rows | 7 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: scene | 6 |
| Auto Topic: import | CO_OCCURS | Auto Topic: rows | 6 |
| Auto Topic: master | CO_OCCURS | Auto Topic: rows | 6 |
| Auto Topic: rows | CO_OCCURS | Propositional Logic | 5 |
| Auto Topic: rows | CO_OCCURS | Auto Topic: square_size | 5 |
| Auto Topic: idx | CO_OCCURS | Auto Topic: rows | 5 |
| Auto Topic: canvas | CO_OCCURS | Auto Topic: rows | 5 |
| Auto Topic: isinstance | CO_OCCURS | Auto Topic: rows | 5 |
| Auto Topic: config | CO_OCCURS | Auto Topic: rows | 4 |
| Auto Topic: fill | CO_OCCURS | Auto Topic: rows | 4 |
| Auto Topic: imports | CO_OCCURS | Auto Topic: rows | 4 |
| Auto Topic: is_solved | CO_OCCURS | Auto Topic: rows | 3 |
| Auto Topic: disabled | CO_OCCURS | Auto Topic: rows | 3 |
| Auto Topic: menu | CO_OCCURS | Auto Topic: rows | 3 |
| Alpha-Beta Pruning | CO_OCCURS | Auto Topic: rows | 3 |
| Auto Topic: new_game | CO_OCCURS | Auto Topic: rows | 3 |
Evidence Chunks
| Source | Confidence | Mentions | Snippet |
|---|---|---|---|
assignments CIS5210-Assignments/M4/hw4-optimized.py | 0.67 | 10 | = ('board', 'rows', 'cols') def __init__(self, board): if board is None: raise ValueError("board cannot be None") if not isinstance(board, list): raise TypeError("board must be a list of rows") self.rows = len(board) self.cols = len(board[0]) if self.rows else 0 for row in board: ... |
assignments CIS5210-Assignments/M4/hw4-optimized.py | 0.67 | 8 | ... #################### # Section 1: Dominoes Game ############################################################ def create_dominoes_game(rows, cols): if not isinstance(rows, int) or not isinstance(cols, int): raise TypeError("rows and cols must be integers") if rows < 0 or cols < 0: ... |
assignments CIS5210-Assignments/M4/hw4-optimized.py | 0.67 | 8 | ... b[row + 1][col] return col + 1 < self.cols and not b[row][col] and not b[row][col + 1] def legal_moves(self, vertical): b = self.board rows = self.rows cols = self.cols if vertical: row_limit = rows - 1 for r in range(row_limit): row1 = b[r] row2 = b[r + 1] for c in range(cols): ... |
assignments CIS5210-Assignments/M4/homework4.py | 0.67 | 7 | ... #################### # Section 1: Dominoes Game ############################################################ def create_dominoes_game(rows, cols): if not isinstance(rows, int) or not isinstance(cols, int): raise TypeError("rows and cols must be integers") if rows < 0 or cols < 0: ... |
assignments CIS5210-Assignments/M4/homework4.py | 0.67 | 7 | ... ): if board is None: raise ValueError("board cannot be None") if not isinstance(board, list): raise TypeError("board must be a list of rows") self.rows = len(board) self.cols = len(board[0]) if self.rows else 0 for row in board: if not isinstance(row, list): raise TypeError("boar ... |
assignments CIS5210-Assignments/M3/homework3_tile_puzzle_gui.py | 0.65 | 6 | n range(rows): row_tiles = [] for col in range(cols): tile = Tile(self, puzzle_board[row][col]) tile.grid(row=row, column=col, padx=1, pady=1) row_tiles.append(tile) self.tiles.append(row_tiles) self.bind("<Up>", lambda event: self.perform_move("up")) self.bind("<Down>", lambda e ... |
assignments CIS5210-Assignments/M3/homework3_tile_puzzle_gui.py | 0.65 | 6 | ePuzzleGUI(tkinter.Frame): def __init__(self, master, rows, cols): tkinter.Frame.__init__(self, master) self.rows = rows self.cols = cols self.puzzle = homework3.create_tile_puzzle(rows, cols) self.board = Board(self, self.puzzle, rows, cols) self.board.pack(side=tkinter.LEFT, pa ... |
assignments CIS5210-Assignments/M4/homework4_dominoes_game_gui.py | 0.65 | 6 | ... lf.update_squares() self.master.update_status() def update_squares(self): game_board = self.game.get_board() for row in range(self.rows): for col in range(self.cols): self.squares[row][col].set_state(game_board[row][col]) class DominoesGUI(tkinter.Frame): def __init__(self, maste ... |
assignments CIS5210-Assignments/M3/homework3.py | 0.63 | 5 | ... down": (1, 0), "left": (0, -1), "right": (0, 1), } def __init__(self, board): self._board = [list(row) for row in board] self.rows = len(self._board) self.cols = len(self._board[0]) if self.rows else 0 key = (self.rows, self.cols) cache = self._CACHE.get(key) if cache is None: si ... |
assignments CIS5210-Assignments/M3/homework3.py | 0.63 | 5 | ... ### # Section 2: Grid Navigation ############################################################ def find_path(start, goal, scene): rows = len(scene) if rows == 0: return None cols = len(scene[0]) sr, sc = start gr, gc = goal if sr < 0 or sr >= rows or sc < 0 or sc >= cols: return N ... |
assignments CIS5210-Assignments/M4/hw4-optimized.py | 0.63 | 5 | if not row1[c] and not row2[c]: return False else: col_limit = cols - 1 for r in range(rows): row = b[r] for c in range(col_limit): if not row[c] and not row[c + 1]: return False return True def copy(self): return DominoesGame([row[:] for row in self.board]) def successors(self, ... |
assignments CIS5210-Assignments/M5/homework5.py | 0.63 | 5 | ... (rr, cc) != cell: arcs.add((cell, (rr, cc))) return list(arcs) def read_board(path): with open(path, "r", encoding="utf-8") as f: rows = [ [ch for ch in line.strip() if ch in "1234567890.*"] for line in f if line.strip() ] if len(rows) != 9 or any(len(row) != 9 for row in rows): ... |
assignments CIS5210-Assignments/M2/homework2_gui.py | 0.61 | 4 | Rows", justify=tk.LEFT) row_label.grid(row=0, padx=5, sticky=tk.W) self.__row_entry = tk.Entry(parent, name="row") self.__row_entry.grid(row=1, padx=5, sticky=tk.EW) self.__row_entry.insert(0, 3) col_label = tk.Label(parent, text="# of Cols", justify=tk.LEFT) col_label.grid(row=2 ... |
assignments CIS5210-Assignments/M3/homework3_tile_puzzle_gui.py | 0.61 | 4 | ... e(background=color) self.itemconfig(self.text, text=tile) class Board(tkinter.Frame): def __init__(self, master, puzzle, rows, cols): tkinter.Frame.__init__(self, master) self.puzzle = puzzle self.rows = rows self.cols = cols puzzle_board = puzzle.get_board() self.tiles = [] for ... |
assignments CIS5210-Assignments/M4/homework4_dominoes_game_gui.py | 0.61 | 4 | ... tate else Square.COLOR_EMPTY self.configure(background=color) class Board(tkinter.Frame): def __init__(self, master, game, rows, cols): tkinter.Frame.__init__(self, master) self.game = game self.vertical = True self.rows = rows self.cols = cols self.squares = [] for row in range( ... |
assignments CIS5210-Assignments/M4/hw4-optimized.py | 0.61 | 4 | ... eError("limit must be an integer") if limit <= 0: return (None, self._evaluate(root_vertical), 1) b = self.board rows = self.rows cols = self.cols # Inline move generation for speed def gen_moves(vert): if vert: row_lim = rows - 1 for r in range(row_lim): row1 = b[r] row2 = b[r + ... |
assignments CIS5210-Assignments/M2/homework2.py | 0.59 | 3 | ... ge(cols): if row[c]: state |= 1 << (base + c) return state def _build_move_masks(self): masks = [] rows = self._rows cols = self._cols for r in range(rows): base = r * cols for c in range(cols): idx = base + c mask = 1 << idx if r > 0: mask |= 1 << ((r - 1) * cols + c) if r + 1 < ... |
assignments CIS5210-Assignments/M2/homework2.py | 0.59 | 3 | mask |= 1 << ((r - 1) * cols + c) if r + 1 < rows: mask |= 1 << ((r + 1) * cols + c) if c > 0: mask |= 1 << (idx - 1) if c + 1 < cols: mask |= 1 << (idx + 1) masks.append(mask) return masks def _reconstruct_solution(self, parents, state): moves = [] while True: prev_state, move_i ... |