One Cut: Difference between revisions
Nikitaivanov (talk | contribs) (Created page with "--- quest: true --- File:onecutlukaszm.png [One Cut](https://play.fancade.com/616369AFDF122214) is a game by LukaszM where you have 1 cut to cut the piece into 2 smaller pieces and try to cover all gray spots to make the shape to win. This is submitted to Fanweek 49: Abstract. It is introduced to Quest in Fancade 1.9. == How to Play == Draw a line from one bordering vertex to another bordering ve...") |
RandomName (talk | contribs) (Reformatting) |
||
| Line 1: | Line 1: | ||
{{Game | |||
|guid=616369AFDF122214 | |||
|title=One Cut | |||
|author=LukaszM | |||
}} | |||
[ | [https://play.fancade.com/616369AFDF122214 One Cut] is a game by [[the-questers#lukaszm|LukaszM]] where you have 1 cut to cut the piece into 2 smaller pieces and try to cover all gray spots to make the shape to win. | ||
This is submitted to [[Version History#fancade-1-9-4|Fanweek]] 49: Abstract. It is introduced to [[Quest]] in [[Fancade 1.9]]. | This is submitted to [[Version History#fancade-1-9-4|Fanweek]] 49: Abstract. It is introduced to [[Quest]] in [[Fancade 1.9]]. | ||
| Line 26: | Line 26: | ||
[[Category:Quest games]] | |||
[[Category:Games]] | [[Category:Games]] | ||
Revision as of 06:31, 29 May 2024
| Title | One Cut |
| Author | LukaszM |
| GUID | 616369AFDF122214 |
One Cut is a game by LukaszM where you have 1 cut to cut the piece into 2 smaller pieces and try to cover all gray spots to make the shape to win.
This is submitted to Fanweek 49: Abstract. It is introduced to Quest in Fancade 1.9.
How to Play
Draw a line from one bordering vertex to another bordering vertex, where the path cannot intersect over each other. After the line is drawn, use those 2 pieces to cover all the gray squares, and win. Pieces can be rotated by tapping them. Note that some cuts may result in no solutions.
Solutions
Note that only the cuts are shown. Click on an image to zoom in; solutions are ordered left-to-right, top-to-bottom. When there are multiple solutions, one solution is shown.
Levels 1-12
[[[/uploads/one-cut-1-12.png]]](
)
Levels 13-24
[[[/uploads/one-cut-13-24.png]]](
)