File: root - text - article - 2020 - 02 - staying-on-a-chess-board.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 407 Views, 24312 Search Bots | 94 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 407 Views, 24312 Search Bots | 94 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Google:
A chess board is an 8x8 grid. Given a knight at any position (x, y) and a number of moves k, we want to figure out after k random moves by a knight, the probability that the knight will still be on the chessboard. Once the knight leaves the board it cannot move again and will be considered off the board.
Here's some starter code:
def is_knight_on_board(x, y, k, cache={}):
# Fill this in.
print is_knight_on_board(0, 0, 1)
# 0.25
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 407 Views, 24312 Search Bots | 94 Words A chess board is an 8x8 grid. Given a knight at any position (x, y) and a number of moves k, we want to figure out after k random moves by a knight, the probability that the knight will still be on the chessboard. Once the knight leaves the board it cannot move again and will be considered off the board.
Here's some starter code:
def is_knight_on_board(x, y, k, cache={}):
# Fill this in.
print is_knight_on_board(0, 0, 1)
# 0.25
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Spectrum Master
- Spreadsheet Column Title
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Find Missing Numbers in an Array
- Sort a Partially Sorted List
- Patterns for breaking down questions you haven
- [Daily Problem] Validate Balanced Parentheses
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Algorithm Interview: Permutations of numbers
©2006~2024 SteakOverCooked - 0.01509 Seconds(s) - 1250.034 KB/s - 30 Online
Memory: 494.14 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !