edderiofer
Edderiofer   Hong Kong
 
 
I play and beta-test puzzle games. If you wish to have me beta-test or play your game, please solve this anagram to get an email highly likely to be mine: erodedfire@limag.omc. This is to prevent spambots or game companies who don't bother reading my profile sending me friend requests.

---

List of beta-tested games:

Alcazar (Android) [play.google.com]
Prune (iOS) [www.prunegame.com]
Doors (PC) [doorsgame.com]
A Good Snowman Is Hard To Build (iOS) [agoodsnowman.com]
ZeGame (PC, iOS) [zegame.jespertheend.com]
Tricone Lab (PC) [www.triconelab.com]
Patterna (PC) [www.patterna-game.com]
Linelight (PC) [linelightgame.com]
Causality (iOS) [loju.co.uk]
Induction (PC) [www.inductiongame.com]
Heat Signature (PC) [www.heatsig.com]
Stinker (iOS, currently testing)
PEG (PC)
Engare (PC) [www.engare.design]
Stack & Crack (iOS) [jambav.com]
.T.E.S.T: Expected Behaviour — Sci-Fi 3D Puzzle Quest (PC)
Scalak (iOS)
Up Left Out (iOS)
Manifold Garden (PC) [manifold.garden]
Rhythm Doctor (PC, currently testing ) [www.rhythmdr.com]
De Pictura (PC, currently testing ) [depictura.net]

---
În prezent offline
Activitate recentă
107 ore înregistrate
ultima dată jucat pe 10 febr.
12,6 ore înregistrate
ultima dată jucat pe 10 febr.
6,8 ore înregistrate
ultima dată jucat pe 31 ian.
Comentarii
💜Gypsyrose💜 25 aug. 2023 la 23:09 
all these months later and I am still waiting :/
💜Gypsyrose💜 13 apr. 2023 la 23:08 
Hi, I am just a puzzler lover who wants to join your group so has sent a request to join as well as a friend request :GDNormal:
2jjy 15 aug. 2019 la 21:32 
Hi, thank you for your comments on the computational complexity of recursed. It has been a long time but recently I had some chance to review these issues. It is very unlikely that the problem is in NP. For the upper bound, I think the game only has single exponentially many distinct subtasks that interest us (e.g., whether it is possible to get an item A out of a chest/get to win if we bring in some item C). The jars are kind of similar in a sense that you can bring more than 1 item into it. If we bring in another jar, then we analyze first why we bring in that jar (e.g., to bring out some certain items or to win). However, I can only prove the upper bound of EXPTIME in this way by dynamic programming over the subtasks. I am interested in whether we can prove it is in PSPACE. Probably the ultimate conclusion is that Recursed is PSPACE-Complete.
kycaver 13 iul. 2018 la 21:37 
Loved your review of Slime Rancher. Scanned some of your other reviews, and they looked great as well. See that you love puzzle games as well.:slimehappy:
checkers_of_shalmone 28 iun. 2018 la 6:56 
Happy Pi day!
Happy Pi day!