Auto Topic: col

auto_col | topic

Coverage Score

Mentioned Chunks

Mentioned Docs

Required Dimensions

definitionpros_cons

Covered Dimensions

definitionpros_cons

Keywords

col

Relations

Source	Type	Target	W
Auto Topic: col	CO_OCCURS	Auto Topic: row	30
Auto Topic: col	CO_OCCURS	Auto Topic: self	27
Auto Topic: col	CO_OCCURS	Auto Topic: def	21
Auto Topic: col	CO_OCCURS	Auto Topic: rows	20
Auto Topic: col	CO_OCCURS	Auto Topic: cols	18
Auto Topic: col	CO_OCCURS	Auto Topic: perform_move	14
Auto Topic: col	CO_OCCURS	Auto Topic: vertical	14
Auto Topic: col	CO_OCCURS	Auto Topic: get_board	13
Auto Topic: col	CO_OCCURS	Auto Topic: raise	8
Auto Topic: col	CO_OCCURS	Auto Topic: tkinter	8
Auto Topic: col	CO_OCCURS	Auto Topic: legal_moves	8
Auto Topic: col	CO_OCCURS	Auto Topic: valueerror	7
Auto Topic: col	CO_OCCURS	Auto Topic: is_legal_move	7
Auto Topic: col	CO_OCCURS	Auto Topic: len	6
Auto Topic: col	CO_OCCURS	Auto Topic: padx	6
Auto Topic: col	CO_OCCURS	Auto Topic: master	6
Auto Topic: col	CO_OCCURS	Auto Topic: int	6
Auto Topic: col	CO_OCCURS	Auto Topic: dominoesgame	6
Auto Topic: col	CO_OCCURS	Auto Topic: import	5
Auto Topic: col	CO_OCCURS	Auto Topic: square_size	5
Auto Topic: col	CO_OCCURS	Auto Topic: copy	4
Auto Topic: col	CO_OCCURS	Auto Topic: fill	4
Auto Topic: col	CO_OCCURS	Auto Topic: scene	4
Auto Topic: col	CO_OCCURS	Auto Topic: pack	4
Auto Topic: col	CO_OCCURS	Auto Topic: isinstance	4
Auto Topic: canvas	CO_OCCURS	Auto Topic: col	4
Auto Topic: col	CO_OCCURS	Propositional Logic	3
Auto Topic: col	CO_OCCURS	Auto Topic: start_and_goal	3
Auto Topic: col	CO_OCCURS	Auto Topic: print	3

Evidence Chunks

Source	Confidence	Mentions	Snippet
assignments CIS5210-Assignments/M2/homework2.py	0.67	13	elf._board) self._cols = len(self._board[0]) if self._rows else 0 def get_board(self): return self._board def perform_move(self, row, col): b = self._board rows = self._rows cols = self._cols b[row][col] = not b[row][col] if row > 0: b[row - 1][col] = not b[row - 1][col] if row + ...
assignments CIS5210-Assignments/M3/homework3_grid_navigation_gui.py	0.67	11	1, y1, width=1, outline="black", fill="gray50" if scene[row][col] else "white") def transform(self, row, col): x = self.square_size * (col + 0.5) y = self.square_size * (row + 0.5) return (x, y) def inverse_transform(self, event): row = int(event.y / self.square_size) col = int(e ...
assignments CIS5210-Assignments/M4/hw4-optimized.py	0.67	11	d not b[row][col] and not 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 + ...
assignments CIS5210-Assignments/M4/homework4.py	0.67	10	l]) and (not b[row + 1][col]) if col + 1 >= self.cols: return False return (not b[row][col]) and (not b[row][col + 1]) def legal_moves(self, vertical): vertical = bool(vertical) b = self.board if vertical: for r in range(self.rows - 1): row = b[r] row2 = b[r + 1] for c in range(s ...
assignments CIS5210-Assignments/M4/homework4.py	0.67	9	... lf.board def reset(self): self.board = [[False] * self.cols for _ in range(self.rows)] def is_legal_move(self, row, col, vertical): if not isinstance(row, int) or not isinstance(col, int): return False if row < 0 or col < 0 or row >= self.rows or col >= self.cols: return False ve ...
assignments CIS5210-Assignments/M4/hw4-optimized.py	0.67	9	... f.board def reset(self): self.board = [[False] * self.cols for _ in range(self.rows)] def is_legal_move(self, row, col, vertical): if not isinstance(row, int) or not isinstance(col, int): return False if row < 0 or col < 0 or row >= self.rows or col >= self.cols: return False b = ...
assignments CIS5210-Assignments/M4/homework4_dominoes_game_gui.py	0.67	8	... rtical = True self.rows = rows self.cols = cols self.squares = [] for row in range(rows): row_squares = [] for col in range(cols): square = Square(self) square.grid(row=row, column=col, padx=1, pady=1) square.bind("<Button-1>", lambda event, row=row, col=col: self.perform_move(ro ...
assignments CIS5210-Assignments/M2/homework2.py	0.67	7	... r("n must be non-negative.") return n ** n def n_queens_valid(board): cols = set() diag1 = set() diag2 = set() for row, col in enumerate(board): if col in cols or (row - col) in diag1 or (row + col) in diag2: return False cols.add(col) diag1.add(row - col) diag2.add(row + col) re ...
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/M4/homework4_dominoes_game_gui.py	0.65	6	row, col): if self.game.is_legal_move(row, col, self.vertical): self.game.perform_move(row, col, self.vertical) self.vertical = not self.vertical self.update_squares() self.master.update_status() def update_squares(self): game_board = self.game.get_board() for row in range(self.r ...
assignments CIS5210-Assignments/M2/homework2.py	0.63	5	iag1 or (row + col) in diag2: return False cols.add(col) diag1.add(row - col) diag2.add(row + col) return True def n_queens_solutions(n): if n < 0: raise ValueError("n must be non-negative.") limit = (1 << n) - 1 board = [0] * n solutions = [] append = solutions.append def dfs(ro ...
assignments CIS5210-Assignments/M3/homework3_grid_navigation_gui.py	0.63	5	... ) self.focus_set() self.configure(highlightthickness=0) def draw_scene(self, scene): for row in range(len(scene)): for col in range(len(scene[0])): x0, y0 = col * self.square_size, row * self.square_size x1, y1 = x0 + self.square_size, y0 + self.square_size self.create_rectangle( ...
assignments CIS5210-Assignments/M4/homework4.py	0.63	5	... self._count_legal_moves(not root_vertical) return root_moves - opp_moves def _apply_move(self, row, col, vertical, filled): if vertical: self.board[row][col] = filled self.board[row + 1][col] = filled else: self.board[row][col] = filled self.board[row][col + 1] = filled def get_b ...
assignments CIS5210-Assignments/M4/hw4-optimized.py	0.63	5	... vertical): return self._count_legal_moves(root_vertical) - \ self._count_legal_moves(not root_vertical) def _apply_move(self, row, col, vertical, filled): b = self.board if vertical: b[row][col] = filled b[row + 1][col] = filled else: b[row][col] = filled b[row][col + 1] = filled ...
assignments CIS5210-Assignments/M4/homework4.pdf	0.61	4	thevertical parameter isTrue, then the current player intends to place a domino on squares (row, col) and (row + 1, col) . If thevertical parameter isFalse, then the current player intends to place a domino on squares(row, col) and (row, col + 1). This convention will 2 be follow ...
assignments CIS5210-Assignments/M4/homework4.pdf	0.61	4	... sited during the search. Recall that if the vertical parameter is True, then the current player intends to place a domino on squares (row, col) and (row + 1, col) , and if thevertical parameter is False, then the current player intends to place a domino on squares(row, col) and ( ...
assignments CIS5210-Assignments/M4/homework4.py	0.61	4	w][col] = filled self.board[row + 1][col] = filled else: self.board[row][col] = filled self.board[row][col + 1] = filled def get_best_move(self, vertical, limit): root_vertical = bool(vertical) if not isinstance(limit, int): raise TypeError("limit must be an integer") if limit <= ...
assignments CIS5210-Assignments/M4/homework4_dominoes_game_gui.py	0.61	4	... board.update_squares() self.update_status() def perform_random_move(self): if not self.game.game_over(self.board.vertical): row, col = self.game.get_random_move(self.board.vertical) self.board.perform_move(row, col) def perform_best_move(self, limit): if not self.game.game_over(s ...