Find a looped path through the grid subject to the
following constraints: the path must proceed from one cell to an
adjacent cell, it must pass through no cell more than once, it must not
go through any numbered cells, and must never make a sharp 60o turn. Each number indicates how many of the adjacent cells are part of the path.
게시글 목록
| 번호 | 제목 |
|---|---|
| 1310 | |
| 1309 | |
| 1308 | |
| 1344 | |
| 1288 | |
| 1253 | |
| 1246 | |
| 1245 | |
| 1244 | |
| 1243 | |
| 1343 | |
| 1234 | |
| 1186 | |
| 1181 | |
| 1169 | |
| 1183 | |
| 1168 | |
| 1342 | |
| 1167 | |
| 1341 | |
| 1166 | |
| 1282 | |
| 1165 | |
| 1339 | |
| 1146 | |
| 1138 | |
| 1338 | |
| 1132 | |
| 1131 | |
| 1130 |
댓글 작성
댓글을 작성하시려면 로그인이 필요합니다.
로그인하기